New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover

Authors:
Per Austrin;Ryan O’Donnell;Li-Yang Tan;John Wright
Affiliations:
University of Toronto;Carnegie Mellon University;Columbia University;Carnegie Mellon University
Venue:
ACM Transactions on Computation Theory (TOCT)
Year:
2014

Citing 16
Cited 0

The hardness of approximation: gap location

Computational Complexity
Gadgets, Approximation, and Linear Programming

SIAM Journal on Computing
On the complexity of K-SAT

Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Some optimal inapproximability results

Journal of the ACM (JACM)
On the power of unique 2-prover 1-round games

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A Tight Characterization of NP with 3 Query PCPs

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming

Journal of Computer and System Sciences - STOC 2001
Optimal algorithms and inapproximability results for every CSP?

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Improved Inapproximability Results for Maximum k-Colorable Subgraph

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Conditional Hardness for Approximate Coloring

SIAM Journal on Computing
Two-query PCP with subconstant error

Journal of the ACM (JACM)
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
Subexponential Algorithms for Unique Games and Related Problems

FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Rounding Semidefinite Programming Hierarchies via Global Correlation

FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives

FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
A new point of NP-hardness for unique games

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that given a 3-colorable graph, it is NP-hard to find a 3-coloring with (16/17 + &egr;) of the edges bichromatic. In a related result, we show that given a satisfiable instance of the 2-to-1 Label Cover problem, it is NP-hard to find a (23/24 + &egr;)-satisfying assignment.