Super-polylogarithmic hypergraph coloring hardness via low-degree long codes
2014 (English)In: Proceedings of the Annual ACM Symposium on Theory of Computing, 2014, 614-623 p.Conference paper (Refereed)
We prove improved inapproximability results for hypergraph coloring using the low-degree polynomial code (aka, the"short code" of Barak et. al. [FOCS 2012]) and the techniques pro-posed by Dinur and Guruswami [FOCS 2013] to incorporatethis code for inapproximability results. In particular, we prove quasi-NP-hardness of the following problems on n-vertex hypergraphs: • Coloring a 2-colorable 8-uniform hypergraph with 2 2Ω(√log log n) colors. • Coloring a 4-colorable 4-uniform hypergraph with 22Ω(√ log log n) colors. • Coloring a 3-colorable 3-uniform hypergraph with (log n) Ω(1√ log log log n) colors. In each of these cases, the hardness results obtained are (at least) superpolynomially stronger (if not exponentially stronger as in the third case) than what was previously known for the respective cases. In fact, prior to this result, (log n)O(1) colors was the strongest quantitative bound on the number of colors ruled out by inapproximability results for O(1)-colorable hypergraphs. The fundamental bottleneck in obtaining coloring in approximability results using the low-degree long code was a ultipartite structural restriction in the PCP construction of Dinur-Guruswami. We are able to get around this restriction by simulating the multipartite structure implicitly by querying just one partition (albeit requiring 8 queries), which yields our result for 2-colorable 8-uniform hypergraphs. The result for 4-colorable 4-uniform hypergraphs is obtained via a "query doubling" method exploiting additional properties of the 8-query test. For 3-colorable 3-uniform hyper-graphs, we exploit the ternary domain to design a test with an additive (as opposed to multiplicative) noise function, and analyze its efficacy in killing high weight Fourier coefficients via the pseudorandom properties of an associated quadratic form. The latter step involves extending the key algebraic ingredient of Dinur-Guruswami concerning testing binary Reed-Muller codes to the ternary alphabet.
Place, publisher, year, edition, pages
2014. 614-623 p.
, Proceedings of the Annual ACM Symposium on Theory of Computing, ISSN 0737-8017
Hardness of approximation, Hypergraph coloring, Short code, Codes (symbols), Color, Coloring, Forward error correction, Fourier analysis, Hardness, Number theory, Binary Reed-Muller codes, Fourier coefficients, Pseudo-random properties, Quantitative bounds, Short codes, Structural restrictions, Graph theory
IdentifiersURN: urn:nbn:se:kth:diva-167512DOI: 10.1145/2591796.2591882ScopusID: 2-s2.0-84904294260ISBN: 9781450327107OAI: oai:DiVA.org:kth-167512DiVA: diva2:819762
4th Annual ACM Symposium on Theory of Computing, STOC 2014, 31 May 2014 through 3 June 2014, New York, NY
QC 201506112015-06-112015-05-222015-06-11Bibliographically approved