A query efficient non‐adaptive long code test with perfect completeness

Long Code testing is a fundamental problem in the area of property testing and hardness of approximation. In this paper, we study how small the soundness s of the Long Code test with perfect completeness can be by using non-adaptive q queries. We show that s = 2q + 3/2q is possible, where q is of the form 2k-1 for any integer k > 2. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 386-406, 2015

[1]  W. Beckner.  Inequalities in Fourier analysis , 1975 .

[2]  Luca Trevisan,et al.  Recycling queries in PCPs and in linearity tests (extended abstract) , 1998, STOC '98.

[3]  Avi Wigderson,et al.  Simple analysis of graph tests for linearity and PCP , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[4]  Luca Trevisan,et al.  Gowers Uniformity, Influence of Variables, and PCPs , 2009, SIAM J. Comput..

[5]  Yonatan Aumann,et al.  Linear Consistency Testing , 1999, RANDOM-APPROX.

[6]  Eric Blais.  Improved Bounds for Testing Juntas , 2008, APPROX-RANDOM.

[7]  Eli Ben-Sasson,et al.  Some 3CNF properties are hard to test , 2003, STOC '03.

[8]  Ran Raz.  A Parallel Repetition Theorem , 1998, SIAM J. Comput..

[9]  Uri Zwick,et al.  Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint , 1998, SODA '98.

[10]  Yuichi Yoshida,et al.  A Query Efficient Non-adaptive Long Code Test with Perfect Completeness , 2010, APPROX-RANDOM.

[11]  Sangxia Huang.  Approximation resistance on satisfiable instances for predicates with few accepting inputs , 2013, STOC '13.

[12]  Noga Alon,et al.  Testing Low-Degree Polynomials over GF(2( , 2003, RANDOM-APPROX.

[13]  Subhash Khot,et al.  On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[14]  Dana Ron,et al.  Property Testing: A Learning Theory Perspective , 2007, COLT.

[15]  Rocco A. Servedio,et al.  Testing for Concise Representations , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[16]  Shachar Lovett.  Lower bounds for adaptive linearity tests , 2008, STACS.

[17]  Jonas Holmerin,et al.  More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP , 2008, Random Struct. Algorithms.

[18]  Eric Blais.  Testing juntas nearly optimally , 2009, STOC '09.

[19]  O. Svensson,et al.  Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling , 2007, FOCS 2007.

[20]  Johan Håstad.  On the NP-Hardness of Max-Not-2 , 2012, APPROX-RANDOM.

[21]  Ryan O'Donnell,et al.  Noise stability of functions with low influences: Invariance and optimality , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[22]  Ryan O'Donnell,et al.  3-bit Dictator Testing: 1 vs. 5/8 , 2009, SODA.

[23]  Subhash Khot,et al.  Query efficient PCPs with perfect completeness , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[24]  Johan Håstad,et al.  On the Approximation Resistance of a Random Predicate , 2007, computational complexity.

[25]  Mihir Bellare,et al.  Linearity testing in characteristic two , 1996, IEEE Trans. Inf. Theory.

[26]  Manuel Blum,et al.  Self-Testing/Correcting with Applications to Numerical Problems , 1993, J. Comput. Syst. Sci..

[27]  M. Ledoux,et al.  Logarithmic Sobolev Inequalities , 2014 .

[28]  Dana Ron,et al.  Testing Basic Boolean Formulae , 2002, SIAM J. Discret. Math..

[29]  Subhash Khot.  Guest column: inapproximability results via Long Code based PCPs , 2005, SIGA.

[30]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[31]  A. Bonami.  Étude des coefficients de Fourier des fonctions de $L^p(G)$ , 1970 .

[32]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[33]  Luca Trevisan,et al.  Probabilistically checkable proofs with low amortized query complexity , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[34]  Mihir Bellare,et al.  Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..

[35]  Johan Håstad,et al.  Randomly supported independence and resistance , 2009, STOC '09.

[36]  Elchanan Mossel,et al.  Approximation Resistant Predicates from Pairwise Independence , 2008, Computational Complexity Conference.

[37]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[38]  Luca Trevisan,et al.  A PCP characterization of NP with optimal amortized query complexity , 2000, STOC '00.

[39]  Prasad Raghavendra,et al.  Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness , 2008, APPROX-RANDOM.

[40]  Ryan O'Donnell,et al.  Conditional hardness for satisfiable 3-CSPs , 2009, STOC '09.

[41]  Subhash Khot,et al.  A 3-query non-adaptive PCP with perfect completeness , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

[42]  Victor Chen,et al.  A Hypergraph Dictatorship Test with Perfect Completeness , 2008, APPROX-RANDOM.

[43]  Ryan O'Donnell,et al.  Analysis of Boolean Functions , 2014, ArXiv.

[44]  Siu On Chan,et al.  Approximation resistance from pairwise independent subgroups , 2013, STOC '13.

[45]  E. Fischer.  THE ART OF UNINFORMED DECISIONS: A PRIMER TO PROPERTY TESTING , 2004 .

[46]  Eldar Fischer,et al.  A Review of Graph Grammars and Preview of ICGT 2002: The First International Conference on Graph Transformation. , 2001 .

[47]  Elchanan Mossel.  Gaussian Bounds for Noise Correlation of Functions , 2007, FOCS 2007.

[48]  Venkatesan Guruswami,et al.  A tight characterization of NP with 3 query PCPs , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[49]  Prasad Raghavendra,et al.  Optimal algorithms and inapproximability results for every CSP? , 2008, STOC.