Super-polylogarithmic hypergraph coloring hardness via low-degree long codes - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Venkatesan Guruswami' in GoogleThis author has not been identified. Look up 'Prahladh Harsha' in GoogleThis author has not been identified. Look up 'Johan Håstad' in GoogleThis author has not been identified. Look up 'Srikanth Srinivasan' in GoogleThis author has not been identified. Look up 'Girish Varma' in Google

runs on WebDSL