Simple analysis of graph tests for linearity and PCP

We give a simple analysis of the PCP (probabilistically Checkable Proof) with low amortized query complexity of Samorodnitsky and Trevisan (2000). The analysis also applied to the linearity testing over finite fields, giving a better estimate of the acceptance probability in terms of the distance of the tested function to the closest linear function.

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

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

[3]  Marcos A. Kiwi,et al.  Probabilistically checkable proofs and the testing of hadamard-like codes , 1996 .

[4]  Noam Nisan,et al.  Hardness vs. randomness , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[5]  Yonatan Aumann,et al.  Linear-Consistency Testing , 2001, J. Comput. Syst. Sci..

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

[7]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.

[8]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[9]  John C. Townsend.  The Construction of Graphs. , 1953 .

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

[11]  Sanjeev Arora,et al.  Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[12]  Mihir Bellare,et al.  Linearity testing in characteristic two , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

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

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

[15]  László Lovász,et al.  Interactive proofs and the hardness of approximating cliques , 1996, JACM.