New Direct-Product Testers and 2-Query PCPs

The “direct-product code” of a function $f$ gives its values on all $k$-tuples $(f(x_1),\dots, f(x_k))$. This basic construct underlies “hardness amplification” in cryptography, circuit complexity, and probabilistically checkable proofs (PCPs). Goldreich and Safra [SIAM J. Comput., 29 (2000), pp. 1132--1154] pioneered its local testing and its PCP application. A recent result by Dinur and Goldenberg [Proceedings of the Forty-Ninth Annual IEEE Symposium on Foundations of Computer Science, 2008, pp. 613--622] enabled for the first time testing proximity to this important code in the “list-decoding” regime. In particular, they give a $2$-query test which works for polynomially small success probability $1/k^{\alpha}$ and show that no such test works below success probability $1/k$. Our main result is a $3$-query test which works for exponentially small success probability $\exp({-k^{\alpha}})$. Our techniques (based on recent simplified decoding algorithms for the same code [R. Impagliazzo et al., Proceeding...

[1]  Noam Nisan,et al.  On Yao's XOR-Lemma , 1995, Electron. Colloquium Comput. Complex..

[2]  Leonid A. Levin,et al.  A hard-core predicate for all one-way functions , 1989, STOC '89.

[3]  Avi Wigderson,et al.  Uniform direct product theorems: simplified, optimized, and derandomized , 2008, SIAM J. Comput..

[4]  Thomas Holenstein,et al.  Parallel repetition: simplifications and the no-signaling case , 2007, STOC '07.

[5]  Luca Trevisan,et al.  List-decoding using the XOR lemma , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[6]  Russell Impagliazzo,et al.  Hardness as randomness: a survey of universal derandomization , 2003, ArXiv.

[7]  Avi Wigderson,et al.  P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.

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

[9]  Uriel Feige,et al.  Two prover protocols: low error at affordable rates , 1994, STOC '94.

[10]  Russell Impagliazzo,et al.  Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification , 2006, FOCS.

[11]  Uriel Feige,et al.  Error Reduction by Parallel Repetition—A Negative Result , 2002, Comb..

[12]  Leonid A. Levin,et al.  One-way functions and pseudorandom generators , 1985, STOC '85.

[13]  Irit Dinur,et al.  The PCP theorem by gap amplification , 2006, STOC.

[14]  Ronitt Rubinfeld,et al.  Spot-checkers , 1998, STOC '98.

[15]  Anup Rao,et al.  Parallel repetition in projection games and a concentration bound , 2008, SIAM J. Comput..

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

[17]  Irit Dinur,et al.  PCPs with small soundness error , 2008, SIGA.

[18]  Omer Reingold,et al.  Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem , 2004, FOCS.

[19]  Oleg Verbitsky Towards the Parallel Repetition Conjecture , 1996, Theor. Comput. Sci..

[20]  Oded Goldreich,et al.  A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem , 1997, RANDOM.

[21]  Ran Raz,et al.  A Counterexample to Strong Parallel Repetition , 2008, FOCS.

[22]  Ran Raz,et al.  A parallel repetition theorem , 1995, STOC '95.

[23]  Ran Raz,et al.  Two Query PCP with Sub-Constant Error , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[24]  Irit Dinur,et al.  Locally Testing Direct Products in the High Error Range , 2008 .