"Super-polylogarithmic hypergraph coloring hardness via low-degree long codes."

Venkatesan Guruswami et al. (2014)

> Home

Details and statistics

DOI: 10.1145/2591796.2591882

access: closed

type: Conference or Workshop Paper

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/GuruswamiHHSV14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/GuruswamiHHSV14
Venkatesan Guruswami, Prahladh Harsha, Johan Håstad, Srikanth Srinivasan, Girish Varma:
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes. STOC 2014: 614-623

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.