| Title: |
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes |
| Article URLs: |
|
| Alternative Article URLs: |
|
| Authors: |
Venkatesan Guruswami |
-
Carnegie Mellon University, Computer Science Department
|
| Prahladh Harsha |
-
Tata Institute of Fundamental Research, Mumbai, INDIA
|
| Johan Håstad |
-
KTH Royal Institute of Technology, Stockholm, SWEDEN
|
| Srikanth Srinivasan |
-
Indian Institute of Technology Bombay, INDIA, Department of Mathematics
|
| Girish Varma |
-
Tata Institute of Fundamental Research, Mumbai, INDIA
|
| Sharing: |
Unknown
|
| Verification: |
Authors have
not verified
information
|
| Artifact Evaluation Badge: |
none
|
| Artifact URLs: |
|
| Artifact Correspondence Email Addresses: |
|
| NSF Award Numbers: |
1115525
|
| DBLP Key: |
conf/stoc/GuruswamiHHSV14
|
| Author Comments: |
|