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

Venkatesan Guruswami, Prahladh Harsha, Johan HÃ¥stad, Srikanth Srinivasan, Girish Varma. Super-polylogarithmic hypergraph coloring hardness via low-degree long codes. In David B. Shmoys, editor, Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014. pages 614-623, ACM, 2014. [doi]

Abstract

Abstract is missing.