Ran Raz
- 1.N. Alon, "Probabilistic Methods in Extremal Finite Set Theory", Proc. of the Conference on Extremal Problems for Finite Sets, Hungary, 199i.Google Scholar
- 2.S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, "Proof verification and intractability of approximation problems", FOG'S 92, lJ -23'. Google ScholarDigital Library
- 3.S. Arora, S. Safra, "Probabilistic Checking of Proofs; A New Characterization of NP", FOCS 9,?, 2-Is.Google Scholar
- 4.L. Babai, L. Fortnow, C. Lund, "Non-Deterministic Ex-ponential Time has Two-Prover Interactive Protocols", FOCS 90, 16-25. Google ScholarDigital Library
- 5.M. Bellare, "Interactive proofs and approximation", ISTCS 93, 266-274.Google Scholar
- 6.M. Bellare, S. Goldwasser, C. Lund, A. Russell, "Effi-cient probabilistic checkable proofs and applications to approximation", STOC 95', 29&90d. Google ScholarDigital Library
- 7.M. Bellare, P. Rogaway, "The complexity of approxi-mating a nonlinear program", In: Cornp/ezity in nu-merical optimization, P. Pardalos, cd., World Scientific, 1993.Google Scholar
- 8.M. Bellare, M. Sudan, "Improved non-approximability results", STOC 94. Google ScholarDigital Library
- 9.M. Ben-or, S. Goldwasser, J. Kilian, A. Wigderson, "Multi Prover Interactive Proofs: How to Remove In-tractability", STOC 88, 11.3-131. Google ScholarDigital Library
- 10.M. Ben-or, S. Goldwasser, J. Kilian, A. Wigderson, "Ef-ficient identification schemes using two prover interac-tive proofs", Crypto 89, 498-506. Google ScholarDigital Library
- 11.J. Cai, A. Condon, R. Lipton, "Playing Games of In-complete Information", STA CS 90. Google ScholarDigital Library
- 12.I. Csiszar, J. Korner, "Information Theory: Coding Theorems for Discrete Memoryless Systems", Academic Press New York-San Francisco-London (1981). Google ScholarDigital Library
- 13.C. Dwork, U. Feige, J. Kilian, M. Naor, S. Safra, "Low Communication, 2-Prover Zero-Knowledge Proofs for NP" Crypto 92, 217-229. Google ScholarDigital Library
- 14.U. Feige, 'On the Success Probability of the Two Provers in One Round Proof Systems", Structures 91, 116-123.Google Scholar
- 15.U. Feige, S. Goldwasser, L. Lovasz, M. Safra, M. Szegedy, "Approximating Clique is Almost NP-Completen, FOCS 91, 2-I2. Google ScholarDigital Library
- 16.U. Feige, J. Kilian, "Two Prover Protocols - Low Error at Affordable Rates", STOC 1994. Google ScholarDigital Library
- 17.U. Feige, L. Lovasz, "Two-prover one-round proof sys-tems, their power and their problems", STOC 1992, 733-744. Google ScholarDigital Library
- 18.L. Fortnow, "Complexity-Theoretic Aspects of Interac-tive Proof Systems", Ph.D. Thesis, MIT/L CS\TR-447, 1989.Google Scholar
- 19.L. Fortnow, J. Rompel, M. Sipser, "On the Power of Multi-Prover Interactive Protocols)), Structures 88, 156-161.Google Scholar
- 20.L. Fortnow, J. Rompel, M. Sipser, "Errata for On the Power of Multi-Prover Interactive Protocols", Struc-tures 90, 318-319.Google Scholar
- 21.R.M. Gray, "Entropy and Information Theory", Springer-Verlag (1990). Google ScholarDigital Library
- 22.B. Kalyanasundaram, G. Schnitger, "The probabilktic communication complexity of set intersection", Struc-tures 87, 41-49.Google Scholar
- 23.J. Kilian, "Strong Separation Models of Multi Prover Interactive Proofs" DIMA CS Workshop on Cryptogra-phy, October 1990.Google Scholar
- 24.D. Lapidot, A. Shamir, "A One-Round, Two-Prover, Zero-Knowledge Protocol for NP", Crypto, 1991. Google ScholarDigital Library
- 25.D. Lapidot, A. Shamir, "Fully Parallelized Multi Prover Protocols for NEXP-time" FOCS 91, 13-18. Google ScholarDigital Library
- 26.C. Lund, M. Yannakakis, "On the hardness of approxi-mating minimization problems", STO C 93, 286-293. Google ScholarDigital Library
- 27.D. Peleg, "On the Maximal Number of Ones in Zero-One Matrices with No Forbidden Rectangles", manuscript, 1990.Google Scholar
- 28.A.A. Razborov, "On the distributional complexity of disjointness", Theoretical Computer Science 106, 1992, 385-390. Google ScholarDigital Library
- 29.G. Tardos. "Multi-prover encoding schemes, and 3- prover interactive proofs." Structures, 1994.Google Scholar
- 30.0. Verbitsky, "Towards the Parallel Repetition Conjec-ture", Structures, 1994.Google Scholar
- 31.0. Verbitsky, "The Parallel Repetition Conjecture for Trees is True", manuscript, 1994.Google Scholar
Index Terms
- A parallel repetition theorem
Recommendations
Strong Parallel Repetition Theorem for Free Projection Games
APPROX '09 / RANDOM '09: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and TechniquesThe parallel repetition theorem states that for any two provers one round game with value at most 1 *** <em>***</em> (for <em>***</em> < 1/2), the value of the game repeated <em>n</em> times in parallel is at most (1 *** <em>***</em> 3)***(<em>n</em> /...
An efficient parallel repetition theorem
TCC'10: Proceedings of the 7th international conference on Theory of CryptographyWe present a general parallel-repetition theorem with an efficient reduction. As a corollary of this theorem we establish that parallel repetition reduces the soundness error at an exponential rate in any public-coin argument, and more generally, any ...
A K-provers parallel repetition theorem for a version of no-signaling model
COCOON'10: Proceedings of the 16th annual international conference on Computing and combinatoricsThe parallel repetition theorem states that for any two provers one round game with value at most 1-ε (for ε < 1/2), the value of the game repeated n times in parallel is at most (1-ε3)Ω(n/ log s) where s is the size of the answers set [Raz98],[Hol07]. ...
Comments