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]
@inproceedings{GuruswamiHHSV14,
title = {Super-polylogarithmic hypergraph coloring hardness via low-degree long codes},
author = {Venkatesan Guruswami and Prahladh Harsha and Johan Håstad and Srikanth Srinivasan and Girish Varma},
year = {2014},
doi = {10.1145/2591796.2591882},
url = {http://doi.acm.org/10.1145/2591796.2591882},
researchr = {https://researchr.org/publication/GuruswamiHHSV14},
cites = {0},
citedby = {0},
pages = {614-623},
booktitle = {Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014},
editor = {David B. Shmoys},
publisher = {ACM},
isbn = {978-1-4503-2710-7},
}