Finding almost-satisfying assignments
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
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
The Approximability of Constraint Satisfaction Problems
SIAM Journal on Computing
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
Near-optimal algorithms for unique games
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?
SIAM Journal on Computing
Optimal algorithms and inapproximability results for every CSP?
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Dualities for Constraint Satisfaction Problems
Complexity of Constraints
Universal algebra and hardness results for constraint satisfaction problems
Theoretical Computer Science
Near-optimal algorithms for maximum constraint satisfaction problems
ACM Transactions on Algorithms (TALG)
Hard constraint satisfaction problems have hard gaps at location 1
Theoretical Computer Science
Constraint Satisfaction Problems of Bounded Width
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Tight bounds on the approximability of almost-satisfiable Horn SAT and exact hitting set
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The complexity of finite-valued CSPs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Robust Satisfiability for CSPs: Hardness and Algorithmic Results
ACM Transactions on Computation Theory (TOCT)
Robust constraint satisfaction and local hidden variables in quantum mechanics
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Constraint Satisfaction Problems Solvable by Local Consistency Methods
Journal of the ACM (JACM)
| Hi-index | 0.00 |
An algorithm for a constraint satisfaction problem is called robust if it outputs an assignment satisfying at least (1-g(ε))-fraction of the constraints given a (1-ε)-satisfiable instance, where g(ε) - 0 as ε - 0, $g(0)=0. Guruswami and Zhou conjectured a characterization of constraint languages for which the corresponding constraint satisfaction problem admits an efficient robust algorithm. This paper confirms their conjecture.