Towards a Characterization of Approximation Resistance for Symmetric CSPs
暂无分享,去创建一个
[1] Madhur Tulsiani,et al. SDP Gaps from Pairwise Independence , 2012, Theory Comput..
[2] Pravesh Kothari,et al. Sum of Squares Lower Bounds from Pairwise Independence , 2015, STOC.
[3] Subhash Khot. On the power of unique 2-prover 1-round games , 2002, STOC '02.
[4] Uri Zwick,et al. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint , 1998, SODA '98.
[5] Johan Håstad,et al. On the Usefulness of Predicates , 2012, 2012 IEEE 27th Conference on Computational Complexity.
[6] Elchanan Mossel,et al. Approximation Resistant Predicates from Pairwise Independence , 2008, Computational Complexity Conference.
[7] Ola Svensson,et al. Approximating Linear Threshold Predicates , 2012, TOCT.
[8] Siu On Chan,et al. Approximation resistance from pairwise independent subgroups , 2013, STOC '13.
[9] Avner Magen,et al. On Quadratic Threshold CSPs , 2012, Discret. Math. Theor. Comput. Sci..
[10] Gustav Hast,et al. Beating a Random Assignment , 2005, APPROX-RANDOM.
[11] Subhash Khot,et al. A characterization of approximation resistance for even k-partite CSPs , 2013, ITCS '13.
[12] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[13] Hong Kong License. GENERALIZATIONS OF HÖLDER ’ S INEQUALITY , 2014 .