A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
NP-Hardness of Coloring 2-Colorable Hypergraph with Poly-Logarithmically Many Colors
2018
International Colloquium on Automata, Languages and Programming
We give very short and simple proofs of the following statements: Given a 2-colorable 4-uniform hypergraph on n vertices, 1. It is NP-hard to color it with log δ n colors for some δ > 0. 2. It is quasi-NP-hard to color it with O log 1−o(1) n colors. In terms of NP-hardness, it improves the result of Guruswam, Håstad and Sudani [SIAM Journal on Computing, 2002], combined with Moshkovitz-Raz [Journal of the ACM, 2010], by an 'exponential' factor. The second result improves the result of Saket
doi:10.4230/lipics.icalp.2018.15
dblp:conf/icalp/Bhangale18
fatcat:mgbf47aqozgf5dbcg6a33wvnba