Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width Four - (Extended Abstract)
暂无分享,去创建一个
[1] Elchanan Mossel. Gaussian Bounds for Noise Correlation of Functions , 2007, FOCS 2007.
[2] Elchanan Mossel,et al. Noise stability of functions with low influences: Invariance and optimality , 2005, IEEE Annual Symposium on Foundations of Computer Science.
[3] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[4] Prasad Raghavendra,et al. Agnostic Learning of Monomials by Halfspaces Is Hard , 2012, SIAM J. Comput..
[5] Subhash Khot,et al. A 3-query non-adaptive PCP with perfect completeness , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).
[6] Victor Chen,et al. A Hypergraph Dictatorship Test with Perfect Completeness , 2008, APPROX-RANDOM.
[7] Yuichi Yoshida,et al. A Query Efficient Non-adaptive Long Code Test with Perfect Completeness , 2010, APPROX-RANDOM.
[8] Sangxia Huang. Approximation resistance on satisfiable instances for predicates with few accepting inputs , 2013, STOC '13.
[9] Johan Håstad,et al. On the Usefulness of Predicates , 2012, 2012 IEEE 27th Conference on Computational Complexity.
[10] Ran Raz. A Parallel Repetition Theorem , 1998, SIAM J. Comput..
[11] Ryan O'Donnell,et al. Conditional hardness for satisfiable 3-CSPs , 2009, STOC '09.
[12] Sorin C. Popescu,et al. Lidar Remote Sensing , 2011 .
[13] Johan Håstad,et al. Randomly supported independence and resistance , 2009, STOC '09.
[14] A. Bonami. Étude des coefficients de Fourier des fonctions de $L^p(G)$ , 1970 .
[15] Sangxia Huang,et al. Approximation Resistance on Satisfiable Instances for Predicates Strictly Dominating Parity , 2012, Electron. Colloquium Comput. Complex..
[16] Elchanan Mossel,et al. Approximation Resistant Predicates from Pairwise Independence , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.
[17] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[18] Subhash Khot. On the power of unique 2-prover 1-round games , 2002, STOC '02.
[19] Elchanan Mossel,et al. Gaussian Bounds for Noise Correlation of Functions and Tight Analysis of Long Codes , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[20] B. Efron,et al. The Jackknife Estimate of Variance , 1981 .
[21] Johan Håstad. On the Approximation Resistance of a Random Predicate , 2009, computational complexity.
[22] Johan Håstad. On the NP-Hardness of Max-Not-2 , 2014, SIAM J. Comput..
[23] Elchanan Mossel,et al. Conditional hardness for approximate coloring , 2005, STOC '06.
[24] Dana Ron,et al. Property Testing , 2000 .
[25] W. Beckner. Inequalities in Fourier analysis , 1975 .
[26] Linqing Tang. Conditional Hardness of Approximating Satisfiable Max 3CSP-q , 2009, ISAAC.
[27] Siu On Chan,et al. Approximation resistance from pairwise independent subgroups , 2013, STOC '13.
[28] Ryan O'Donnell,et al. 3-bit Dictator Testing: 1 vs. 5/8 , 2009, SODA.
[29] Ryan O'Donnell,et al. A new point of NP-hardness for unique games , 2012, STOC '12.
[30] 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..