Derandomized Parallel Repetition via Structured PCPs

Computational Complexity

Volumn 20, Issue 2, 2011, Pages 207-327

  Dinur, Irit ^a   Meir, Or ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

de Bruijn; derandomized parallel repetition; direct product; direct product test; low error; PCP

Indexed keywords

EID: 79960562417     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-011-0013-5     Document Type: Article

References (29)

1. Sanjeev Arora, Carsten Lund (1996). Hardness of Approximations. PW Publishing.
2. Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy (1998) Proof verification and Intractability of Approximation Problems. Journal of ACM 45(3): 501-555 Preliminary version in FOCS 1992.
3. Sanjeev Arora, Shmuel Safra (1998) Probabilistic Checkable Proofs: A New Characterization of NP. Journal of ACM volume 45(1): 70-122 Preliminary version in FOCS 1992.
4. Sanjeev Arora, Madhu Sudan (2003) Improved Low-Degree Testing and its Applications. Combinatorica 23(3): 365-426.
5. László Babai, Lance Fortnow, Leonid A. Levin, Mario Szegedy (1991). Checking Computations in Polylogarithmic Time. In STOC, 21-31.
6. Mihir Bellare, Shafi Goldwasser, Carsten Lund, Alexander Russell (1993). Efficient probabilistically checkable proofs and applications to approximations. In STOC, 294-304.
7. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil Vadhan (2006) Robust PCPs of Proximity, Shorter PCPs and Applications to Coding. SIAM Journal of Computing 36(4): 120-134.
8. Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah (2009). Sound 3-Query PCPPs Are Long. TOCT1(2).
9. Peter J. Cameron (1998) Combinatorics: Topics, Techniques, Algorithms. Cambridge University Press, Cambridge CB2 2RU, MA, USA.
10. Irit Dinur (2007) The PCP Theorem by Gap Amplification. Journal of ACM 54(3): 241-250 Preliminary version in STOC 2006.
11. Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra (1999). PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability. In STOC, 29-40.
12. Irit Dinur, Elazar Goldenberg (2008). Locally Testing Direct Product in the Low Error Range. In FOCS, 613-622.
13. Irit Dinur, Praladh Harsha (2009). Composition of low-error 2-query PCPs using decodable PCPs. In FOCS.
14. Irit Dinur, Or Meir (2010). Derandomized Parallel Repetition via Structured PCPs. In CCC.
15. Irit Dinur, Omer Reingold (2006) Assignment testers: Towards combinatorial proof of the PCP theorem. SIAM Journal of Computing 36(4): 155-164.
16. Uriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, Mario Szegedy (1996) Interactive Proofs and the Hardness of Approximating Cliques. J. ACM 43(2): 268-292.
17. Uriel Feige, Joe Kilian (1995). Impossibility results for recycling random bits in two-prover proof systems. In STOC, 457-468.
18. Oded Goldreich, Shmuel Safra (2000) A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem. SIAM J. Comput. 29(4): 1132-1154.
19. Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson (2008). Uniform direct product theorems: simplified, optimized, and derandomized. In STOC, 579-588.
20. Russell Impagliazzo, Valentine Kabanets, Avi Wigderson (2009). New direct-product testers and 2-query PCPs. In STOC, 131-140.
21. Subhash Khot (2006) Ruling Out PTAS for Graph Min-Bisection, Dense k-Subgraph, and Bipartite Clique. SIAM J. Comput. 36(4): 1025-1071.
22. Thomson Leighton F. (1992) Introduction to parallel algorithms and architectures: array, trees, hypercubes. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA.
23. Alexander Lubotzky, R. Phillips, P. Sarnak (1988) Ramanujan graphs. Combinatorica 8(3): 261-277.
24. Or Meir (2009). Combinatorial PCPs with efficient verifiers. In FOCS.
25. Dana Moshkovitz, Ran Raz (2008). Two Query PCP with Sub-Constant Error. In FOCS. Full version is available as ECCC TR08-071.
26. Christos H. Papadimitriou, Mihalis Yannakakis (1991) Optimization, Approximation, and Complexity Classes. J. Comput. Syst. Sci. 43(3): 425-440.
27. Alexander Polishchuk, Daniel A. Spielman (1994). Nearly- linear size holographic proofs. In STOC, 194-203.
28. Ran Raz (1998) A Parallel Repetition Theorem. SIAM J. Comput. 27(3): 763-803.
29. Ran Raz, Shmuel Safra (1997). A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP. In STOC, 475-484.