SDP gaps for 2-to-1 and other label-cover variants
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
On the conditional hardness of coloring a 4-colorable graph with super-constant number of colors
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Unique Games with Entangled Provers Are Easy
SIAM Journal on Computing
Query-efficient dictatorship testing with perfect completeness
Property testing
Query-efficient dictatorship testing with perfect completeness
Property testing
Linear index coding via semidefinite programming
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On the hardness of pricing loss-leaders
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A new point of NP-hardness for unique games
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
An invariance principle for polytopes
Journal of the ACM (JACM)
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.00 |
We study the AprxColoring$(q,Q)$ problem: Given a graph $G$, decide whether $\chi(G)\le q$ or $\chi(G)\ge Q$. We present hardness results for this problem for any constants $3\le qProceedings of the 34th Annual ACM Symposium on Theory of Computing, 2002, pp. 767-775]. For $q=3$, we base our hardness result on a certain “${\rhd\hskip-0.5emAnn. of Math. (2), to appear] and should have wider applicability.