A parallel repetition theorem

SIAM Journal on Computing

Volumn 27, Issue 3, 1998, Pages 763-803

  Raz, Ran ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Direct product; Interactive proofs; Parallel repetition

Indexed keywords

EID: 0001226672     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795280895     Document Type: Article

References (45)

1. N. ALON, Probabilistic methods in extremal finite set theory, in Proc. Conference on Extremal Problems for Finite Sets, Bolyai Soc. Math. Stud. 3, János Bolyai Society, Budapest, Hungary, 1994, pp. 39-57.
2. S. ARORA, Proof Verification and Hardness of Approximation Problems, Ph.D. dissertation, University of California, Berkeley, CA, http://www.cs.princeton.edu/-arora, 1994
3. S. ARORA AND C. LUND, Hardness of approximations, in Approximation Algorithms for NPHard Problems, D. Hochbaum, ed., PWS Publishing, Boston, MA, 1996; also available online from http://www.es.princeton.edu/-arora.
4. S. ARORA AND S. SAFRA, Probabilistic checking of proofs: A new characterization of NP, in Proc. FOCS 1992, IEEE Computer Society Press, Los Alamitos, CA, pp. 2-13.
5. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SZEGEDY, Proof verification and intractability of approximation problems, in Proc. FOCS 1992, IEEE Computer Society Press, Los Alamitos, CA, pp. 14-23.
6. M. BELLARE, Interactive proofs and approximation, in Proc. Israel Symposium on Theory of Computing and Systems, IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 266-274.
7. L. BABAI, L. FORTNOW, AND C. LUND, Non-deterministic exponential time has two-prover interactive protocols, in Proc. FOCS 1990, IEEE Computer Society Press, Los Alamitos, CA, pp. 16-25.
8. M. BELLARE, S. GOLDWASSER, C. LUND, AND A. RUSSELL, Efficient probabilistic checkable proofs and applications to approximation, in Proc. STOC 1993, ACM, New York, pp. 294-304.
9. M. BELLARE, O. GOLDREICH, AND M. SUDAN, Free bits, PCPs, and nonapproximability-towards tight results, SIAM J. Comput., 27 (1998), pp. 804-915.
10. M. BELLARE AND P. ROGAWAY, The complexity of approximating a nonlinear program, Math. Programming, 69 (1995), pp. 429-441.
11. M. BELLARE AND M. SUDAN, Improved non-approximability results, in Proc. STOC 1994, ACM, New York, pp. 184-193.
12. M. BEN-OR, S. GOLDWASSER, J. KILIAN, AND A. WIGDERSON, Multi prover interactive proofs: How to remove intractability, in Proc. STOC 1988, ACM, New York, pp. 113-131.
13. M. BEN-OR, S. GOLDWASSER, J. KILIAN, AND A. WIGDERSON, Efficient identification schemes using two prover interactive proofs, in Proc. Crypto 1989, Springer-Verlag, New York, 1990, pp. 498-506.
14. J. CAI, A. CONDON, AND R. LIPTON, On bounded round multi-prover interactive proof systems, in Proc. Structure in Complexity Theory, 1990, IEEE Computer Society Press, Los Alamitos, CA, pp. 45-54.
15. J. CAI, A. CONDON, AND R. LIPTON, Playing games of incomplete information, Theoret. Comput. Sci., 103 (1992), pp. 25-38.
16. J. CAI, A. CONDON, AND R. LIPTON, PSPACE is provable by two provers in one round, J. Comput. System Sci., 48 (1994), pp. 183-193.
17. I. CSISZAR AND J. KORNER, Information Theory: Coding Theorems for Discrete Memoryless Systems, Academic Press, New York, London, 1981.
18. C. DWORK, U. FEIGE, J. KILIAN, M. NAOR, AND S. SAFRA, Low communication, 2-prover zero-knowledge proofs for NP, in Proc. Crypto 1992, Springer-Verlag, Berlin, pp. 217-229.
19. U. FEIGE, On the success probability of the two provers in one round proof systems, in Proc. Structures 1991, pp. 116-123.
20. U. FEIGE, Error Reduction by Parallel Repetition: The State of the Art, Technical report CS95-32, Weizmann Institute of Science, Rehovot, Israel.
21. L. FORTNOW, Complexity-Theoretic Aspects of Interactive Proof Systems, Ph.D. thesis, Report MIT/LCS/TR-447, MIT, Cambridge, MA, 1989.
22. U. FEIGE, S. GOLDWASSER, L. LOVASZ, M. SAFRA, AND M. SZEGEDY, Approximating clique is almost NP-complete, in Proc. FOCS 1991, IEEE Computer Society Press, Los Alamitos, CA, pp. 2-12.
23. U. FEIGE AND J. KILIAN, Two prover protocols: Low error at affordable rates, in Proc. STOC 1994, ACM, New York, pp. 172-183.
24. U. FEIGE AND J. KILIAN, Impossibility results for recycling random bits in two prover proof systems, in Proc. STOC 1995, ACM, New York, pp. 457-468.
25. U. FEIGE AND L. LOVASZ, Two-prover one-round proof systems, their power and their problems, in Proc. STOC 1992, ACM, New York, pp. 733-744.
26. L. FORTNOW, J. ROMPEL, AND M. SIPSER, On the power of multi-prover interactive protocols, in Proc. Structures 1988, pp. 156-161.
27. U. FEIGE AND O. VERBITSKY, Error reduction by parallel repetition: A negative result, in Proc. 11th Annual IEEE Conference on Computational Complexity, 1996, IEEE Computer Society Press, Los Alamitos, CA, pp. 70-76.
28. L. FORTNOW, J. ROMPEL, AND M. SIPSER, Errata for "On the power of multi-prover interactive protocols," in Proc. Structure in Complexity Theory 1990, IEEE Computer Society Press, Los Alamitos, CA, pp. 318-319.
29. R. M. GRAY, Entropy and Information Theory, Springer-Verlag, New York, 1990.
30. J. HASTAD, Testing of the long code and hardness for clique, in Proc. STOC 1996, ACM, New York, pp. 11-19.
31. 1-ε, in Proc. FOGS 1996, IEEE Computer Society Press, Los Alamitos, CA, pp. 627-636.
32. J. HASTAD, Some optimal inapproximability results, in Proc. STOC 1997, ACM, New York, pp. 1-10.
33. J. KILIAN, Strong Separation Models of Multi Prover Interactive Proofs, DIMACS Workshop on Cryptography, October 1990.
34. E. KUSHILEVITZ AND N. NISAN, Communication Complexity, Cambridge University Press, London, Cambridge, 1997.
35. B. KALYANASUNDARAM AND G. SCHNITGER, The probabilistic communication complexity of set intersection, in Proc. Structure in Complexity Theory 1987, IEEE Computer Society Press, Los Alamitos, CA, pp. 41-49.
36. D. LAPIDOT AND A. SHAMIR, A one-round, two-rover, zero-knowledge protocol for NP, in Combinatorica, 15 (1995), pp. 203-214.
37. D. LAPIDOT AND A. SHAMIR, Fully parallelized multi prover protocols for NEXP-time, in Proc. FOGS 1991, IEEE Computer Society Press, Los Alamitos, CA, pp. 13-18.
38. C. LUND AND M. YANNAKAKIS, On the hardness of approximating minimization problems, in Proc. STOC 1993, ACM, New York, pp. 286-293.
39. D. PELEG, On the maximum density 0-1 Matrices with no forbidden rectangles, Discrete Math., 140 (1995), pp. 269-274.
40. R. RAZ, A parallel repetition theorem, in Proc. STOC 1995, ACM, New York, pp. 447-556.
41. A. A. RAZBOROV, On the distributional complexity of disjointness, Theoret. Comput. Sci., 106 (1992), pp. 385-390.
42. I. PARNAFES, R. RAZ, AND A. WIGDERSON, Direct product results and the GCD problem in old and new communication models, in Proc. STOC 1997, ACM, New York, pp. 363-372.
43. G. TARDOS, Multi-prover encoding schemes, and three-prover proof systems, J. Comput. System Sci., 53 (1996), pp. 251-260.
44. O. VERBITSKY, Towards the parallel repetition conjecture, Theoret. Comput. Sci., 157 (1996), pp. 277-282.
45. O. VERBITSKY, The Parallel Repetition Conjecture for Trees is True, manuscript, 1994.