Is constraint satisfaction over two variables always easy?
暂无分享,去创建一个
[1] Ran Raz,et al. A parallel repetition theorem , 1995, STOC '95.
[2] Erez Petrank. The hardness of approximation: Gap location , 2005, computational complexity.
[3] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[4] G. Andersson,et al. Some new randomized approximation algorithms , 2000 .
[5] Subhash Khot,et al. On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[6] David P. Williamson,et al. Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming , 2001, STOC '01.
[7] Subhash Khot,et al. Hardness results for coloring 3-colorable 3-uniform hypergraphs , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[8] Sanjeev Khanna,et al. On the Hardness of Approximating Max k-Cut and its Dual , 1997, Chic. J. Theor. Comput. Sci..
[9] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[10] Luca Trevisan,et al. On Weighted vs Unweighted Versions of Combinatorial Optimization Problems , 2001, Inf. Comput..
[11] Gunnar Andersson,et al. An Approximation Algorithm for Max p-Section , 1999, STACS.
[12] P. Rowlinson. FOURIER ANALYSIS ON FINITE GROUPS AND APPLICATIONS (London Mathematical Society Student Texts 43) , 2000 .
[13] Johan Håstad,et al. A new way to use semidefinite programming with applications to linear equations mod p , 2001, SODA '99.
[14] A. Terras. Fourier Analysis on Finite Groups and Applications: Index , 1999 .
[15] Uri Zwick,et al. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint , 1998, SODA '98.
[16] Venkatesan Guruswami,et al. A new multilayered PCP and the hardness of hypergraph vertex cover , 2003, STOC '03.
[17] Alan M. Frieze,et al. Improved approximation algorithms for MAXk-CUT and MAX BISECTION , 1995, Algorithmica.
[18] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[19] Uri Zwick,et al. Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems , 1999, STOC '99.