Conditional hardness for satisfiable 3-CSPs

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 493-502

  Donnell, Ryan O' ^a   Wu, Yi ^a  

^a Carnegie Mellon University   (United States)

Author keywords

Hardness of approximation; Khot's conjecture; PCP; Satisfiable 3 CSPs

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS; HARDNESS OF APPROXIMATION; INAPPROXIMABILITY; KHOT'S CONJECTURE; LOWER BOUNDS; NP-HARD; OPEN PROBLEMS; PCP; SATISFIABLE 3-CSPS; UPPER BOUND;

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; CONTROL THEORY; HARDNESS;

APPROXIMATION ALGORITHMS;

EID: 70350593369     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536482     Document Type: Conference Paper

References (28)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501-555, 1998.
2. S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45(1):70-122, 1998.
3. P. Austrin. Balanced Max-2Sat might not be hardest. In Proc. 39th ACM Symp. on the Theory of Computing, pages 189-197, 2007.
4. M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCPs, and nonapproximability - towards tight results. SIAM Journal on Computing, 27(3):804-915, 1998.
5. N. Creignou. A dichotomy theorem for maximum generalized satisfiability problems. Journal of Computing and Sys. Sci., 51(3):511-522, 1995.
6. N. Creignou, S. Khanna, and M. Sudan. Complexity classifications of boolean constraint satisfaction problems. SIAM, Philadelphia, PA, 2001.
7. I. Dinur, E. Mossel, and O. Regev. Conditional hardness for approximate coloring. In Proc. 38th ACM Symp. on the Theory of Computing, pages 344-353, 2006.
8. V. Guruswami and S. Khot. Hardness of max 3SAT with no mixed clauses. In Proc. 20th IEEE Conference on Computational Complexity, pages 154-162, 2005.
9. V. Guruswami, D. Lewin, M. Sudan, and L. Trevisan. A tight characterization of NP with 3 query PCPs. Electronic Colloq. on Comp. Complexity (ECCC), 5(34), 1998.
10. J. Håstad. Some optimal inapproximability results. Journal of the ACM, 48(4):798-859, 2001.
11. J. Håstad and S. Khot. Query efficient PCPs with perfect completeness. Theory of Computing, 1(1):119-148, 2005.
12. H. Karloff and U. Zwick. A 7/8-approximation algorithm for Max-3Sat? In Proc. 38th IEEE Symp. on Foundations of Comp. Sci., pages 406-415, 1997.
13. S. Khot. On the power of unique 2-prover 1-round games. In Proc. 34th ACM Symp. on the Theory of Computing, pages 767-775, 2002.
14. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM Journal on Computing, 37(1):319-357, 2007.
15. S. Khot and R. O'Donnell. SDP gaps and UGC-hardness for MaxCutGain. In Proc. 47th IEEE Symp. on Foundations of Comp. Sci., pages 217-226, 2006.
16. S. Khot and O. Regev. Vertex Cover might be hard to approximate to within 2 - e. Journal of Computing and Sys. Sci., 74(3):335-349, 2008.
17. S. Khot and R. Saket. A 3-query non-adaptive PCP with perfect completeness. In Proc. 21st IEEE Conference on Computational Complexity, pages 159-169, 2006.
18. E. Mossel. Gaussian bounds for noise correlation of functions. In Proc. 46th IEEE Symp. on Foundations of Comp. Sci., 2008.
19. E. Mossel, R. O'Donnell, and K. Oleszkiewicz. Noise stability of functions with low influences: invariance and optimality. In Proc. 46th IEEE Symp. on Foundations of Comp. Sci., pages 21-30, 2005. To appear, Annals of Mathematics.
20. R. O'Donnell. Analysis of boolean functions lecture notes, 2007. http://www.cs.cmu.edu/ odonnell/boolean-analysis/.
21. R. O'Donnell and Y. Wu. An optimal SDP algorithm for Max-Cut, and equally optimal Long Code tests. In Proc. 40th ACM Symp. on the Theory of Computing, pages 335-344, 2008.
22. R. O'Donnell and Y. Wu. 3-bit dictator testing: 1 vs. 5/8, 2009. To appear in Proc. 20th ACM-SIAM Symp. on Discrete Algorithms.
23. P. Raghavendra. Optimal algorithms and inapproximability results for every csp? In Proc. 40th ACM Symp. on the Theory of Computing, pages 245-254, 2008.
24. R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763-803, 1998.
25. A. Samorodnitsky and L. Trevisan. A PCP characterization of NP with optimal amortized query complexity. In Proc. 32nd ACM Symp. on the Theory of Computing, pages 191-199, 2000.
26. L. Trevisan, G. Sorkin, M. Sudan, and D. Williamson. Gadgets, approximation, and linear programming. SIAM Journal on Computing, 29(6):2074-2097, 2000.
27. U. Zwick. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. In Proc. 9th ACM-SIAM Symp. on Discrete Algorithms, pages 201-210, 1998.
28. U. Zwick. Computer assisted proof of optimal approximability results. In Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, pages 496-505, 2002.