Is constraint satisfaction over two variables always easy?

Random Structures and Algorithms

Volumn 25, Issue 2, 2004, Pages 150-178

  Engebretsen, Lars ^a   Guruswami, Venkatesan ^b  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 11144262799     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.20026     Document Type: Article

References (20)

1. G. Andersson, An approximation algorithm for max p-section, Proc 16th Ann Symp Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 1563, Trier, 4-6 March 1999, pp. 237-247.
2. G. Andersson, Some new randomized approximation algorithms, Doctoral dissertation, Department of Numerical Analysis and Computer Science, Royal Institute of Technology, May 2000.
3. G. Andersson, L. Engebretsen, and J. Håstad, A new way of using semidefinite programming with applications to linear equations mod p, J Algorithms 39(2) (May 2001), 162-204.
4. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and the hardness of approximation problems, J ACM 45(3) (May 1998), 501-555.
5. P. Crescenzi, R. Silvestri, and L. Trevisan, On weighted vs unweighted versions of combinatorial optimization problems, Inform Comput 167(1) (May 2001), 10-26.
6. I. Dinur, V. Guruswami, S. Khot, and O. Regev, A new multilayered PCP and the hardness of hypergraph vertex cover, Proc 35th Annu ACM Symp Theory of Computing, June 2003, pp. 595-601.
7. U. Feige, A threshold of In n for approximating set cover, J ACM 45(4) (July 1998), 634-652.
8. A. Frieze and M. Jerrum, Improved approximation algorithms for MAX k-CUT and MAX BISECTION, Algorithmica 18 (1997), 67-81.
9. M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J ACM 42(6) (November 1995), 1115-1145.
10. M. X. Goemans and D. P. Williamson, Approximation algorithms for Max-3-Cut and other problems via complex semidefinite programming, Proc 33rd Annu ACM Symp Theory of Computing, Hersonissos, Crete, Greece, 6-8 July 2001, pp. 443-452.
11. J. Håstad, Some optimal inapproximability results, J ACM 48(4) (July 2001), 798-859.
12. V. Kann, S. Khanna, J. Lagergren, and A. Panconesi, On the hardness of approximating Max k-Cut and its dual, Chicago J Theoret Comput Sci (June 1997).
13. S. Khot, On the power of unique 2-prover 1-round games, Proc 34th Annu ACM Symp Theory of Computing, Montréal, PQ, Canada, 19-21 May 2002, pp. 767-775.
14. S. Khot, Hardness results for coloring 3-colorable 3-uniform hypergraphs, Proc 43rd IEEE Symp Foundations of Computer Science, Vancouver, BC, Canada, 16-19 November 2002, pp. 23-32.
15. E. Petrank, The hardness of approximation: Gap location, Comput Complexity 4(2) (1994), 133-157.
16. R. Raz, A parallel repetition theorem, SIAM J Comput 27(3) (June 1998), 763-803.
17. J. S. Rose, A course on group theory, Cambridge University Press, Cambridge, 1978.
18. A. Terras, Fourier analysis on finite groups and applications, London Mathematical Society Student Texts 43, Cambridge University Press, Cambridge, 1999.
19. U. Zwick, Approximation algorithms for constraint satisfaction programs involving at most three variables per constraint, Proc Ninth Annu ACM-SIAM Symp Discrete Algorithms, San Francisco, CA, 25-27 January 1998, pp. 201-210.
20. U. Zwick, Outward rotations: A tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems, Proc Thirty-First Annu ACM Symp Theory of Computing, Atlanta, GA, 1-4 May 1999, pp. 679-687.