Towards a Characterization of Approximation Resistance for Symmetric CSPs
暂无分享,去创建一个
[1] Subhash Khot,et al. On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[2] Uri Zwick,et al. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint , 1998, SODA '98.
[3] Avner Magen,et al. On Quadratic Threshold CSPs , 2012, Discret. Math. Theor. Comput. Sci..
[4] Madhur Tulsiani,et al. A characterization of strong approximation resistance , 2013, Electron. Colloquium Comput. Complex..
[5] Gustav Hast,et al. Beating a Random Assignment , 2005, APPROX-RANDOM.
[6] Ola Svensson,et al. Approximating Linear Threshold Predicates , 2012, TOCT.
[7] Siu On Chan,et al. Approximation resistance from pairwise independent subgroups , 2013, STOC '13.
[8] Madhur Tulsiani. CSP gaps and reductions in the lasserre hierarchy , 2009, STOC '09.
[9] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.
[10] Madhur Tulsiani,et al. SDP Gaps from Pairwise Independence , 2012, Theory Comput..
[11] Johan Håstad,et al. On the Usefulness of Predicates , 2012, 2012 IEEE 27th Conference on Computational Complexity.
[12] W. Cheung,et al. Generalizations of Hölder's inequality , 2001 .
[13] Pravesh Kothari,et al. Sum of Squares Lower Bounds from Pairwise Independence , 2015, STOC.
[14] Elchanan Mossel,et al. Approximation Resistant Predicates from Pairwise Independence , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.
[15] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[16] Subhash Khot,et al. A characterization of approximation resistance for even k-partite CSPs , 2013, ITCS '13.