On the approximation resistance of a random predicate

Computational Complexity

Volumn 18, Issue 3, 2009, Pages 413-434

  Håstad, Johan ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Approximation algorithms; Approximation resistance; Constraint satisfaction problem

Indexed keywords

EID: 71549164098     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-009-0262-8     Document Type: Article

References (16)

1. M. Bellare, O. Goldreich & M. Sudan (1998). Free bits, PCPs and nonapproximability - Towards tight results. SIAM Journal on Computing 27, 804-915.
2. M. Goemans & D. Williamson (1995). Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM 42, 1115-1145.
3. T. Gowers (1998). A new proof of Szemerédi's theorem for progressions of length four. Geometric and Functional Analysis 8, 529-551.
4. T. Gowers (2001). A new proof of Szemerédi's theorem. Geometric and Functional Analysis 11, 465-588.
5. V. Guruswami, D. Lewin, M. Sudan & L. Trevisan (1998). A tight characterization of NP with 3 query PCPs. In Proceedings of 39th Annual IEEE Symposium on Foundations of Computer Science, 8-17. IEEE, Palo Alto.
6. G. Hast (2005). Beating a random assignment. KTH, Stockholm. Ph.D Thesis.
7. J. Håstad (2001). Some optimal inapproximability results. Journal of ACM 48, 798-859.
8. J. Håstad (2005). Every 2-CSP allows nontrivial approximation. In Proceedings of the 37th Annual ACM Symposium on Theory of Computation, 740-746. Final version accepted for publication in Computational Complexity.
9. J. Håstad (2007). On the approximation resistance of a random predicate. In Proceedings of RANDOM 2007 and APPROX 2007, LNCS 4627, 149-163.
10. S. Khot (2002). On the power of unique 2-prover 1-round games. In Proceedings of 34th ACM Symposium on Theory of Computating, 767-775.
11. S. Khot & O. Regev (2003). Vertex cover might be hard to approximate to within 2 - ε. In Proc. of 18th IEEE Annual Conference on Computational Complexity (CCC), 379-386.
12. A. Samorodnitsky & L. Trevisan (2000). A PCP characterization of NP with optimal amortized query complexity. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, 191-199.
13. A. Samorodnitsky & L. Trevisan (2006). Gowers uniformity, influence of variables and PCPs. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 11-20.
14. T. Schaefer (1978). The complexity of satisfiability problems. In Conference Record of the Tenth Annual ACM Symposium on Theory of Computing, 216-226.
15. U. Zwick (1998). Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. In Proceedings 9th Annual ACMSIAM Symposium on Discrete Algorithms, 201-210. ACM.
16. U. Zwick (2006). Personal Communication.