On the complexity of H-coloring
Journal of Combinatorial Theory Series B
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Cryptographic primitives based on hard learning problems
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
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
Hardness Results for Coloring 3 -Colorable 3 -Uniform Hypergraphs
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
A Dichotomy Theorem for Constraints on a Three-Element Set
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
On the Existence of Pseudorandom Generators
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Node-and edge-deletion NP-complete problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Relations between Average Case Complexity and Approximation Complexity
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
More on Average Case vs Approximation Complexity
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0--1 Programming
Mathematics of Operations Research
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Journal of the ACM (JACM)
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Graph Minors. XX. Wagner's conjecture
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Noise stability of functions with low in.uences invariance and optimality
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Witnesses for non-satisfiability of dense random 3CNF formulas
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
On Worst-Case to Average-Case Reductions for NP Problems
SIAM Journal on Computing
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?
SIAM Journal on Computing
Unique games on expanding constraint graphs are easy: extended abstract
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Optimal algorithms and inapproximability results for every CSP?
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Approximation Resistant Predicates from Pairwise Independence
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Two Query PCP with Sub-Constant Error
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
CSP gaps and reductions in the lasserre hierarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Constraint Satisfaction Problems of Bounded Width
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Public-key cryptography from different assumptions
Proceedings of the forty-second ACM symposium on Theory of computing
Detecting high log-densities: an O(n¼) approximation for densest k-subgraph
Proceedings of the forty-second ACM symposium on Theory of computing
Subexponential Algorithms for Unique Games and Related Problems
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Bypassing UGC from some optimal geometric inapproximability results
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Subsampling mathematical relaxations and average-case complexity
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Hypercontractivity, sum-of-squares proofs, and their applications
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On the Usefulness of Predicates
CCC '12 Proceedings of the 2012 IEEE Conference on Computational Complexity (CCC)
Hi-index | 0.00 |
This work studies several questions about the optimality of semidefinite programming (SDP) for constraint satisfaction problems (CSPs). First we propose the hypothesis that the well known Basic SDP relaxation is actually optimal for random instances of constraint satisfaction problems for every predicate. This unifies several conjectures proposed in the past, and suggests a unifying principle for the average-case complexity of CSPs. We provide several types of indirect evidence for the truth of this hypothesis, and also show that it (and its variants) imply several conjectures in hardness of approximation including polynomial factor hardness for the densest k subgraph problem and hard instances for the Sliding Scale Conjecture of Bellare, Goldwasser, Lund and Russell (1993). Second, we observe that for every predicate P, the basic SDP relaxation achieves the same approximation guarantee for the CSP for P and for a more general problem (involving not just Boolean but constrained vector assignments), which we call the Generalized CSP for P. Raghavendra (2008) showed that it is UGC-hard to approximate the CSP for P better than this guarantee. We show that it is NP-hard to approximate the Generalized CSP for P better than this guarantee.