Error reduction by parallel repetition - A negative result

Combinatorica

Volumn 22, Issue 4, 2002, Pages 461-478

  Feige, Uriel ^a   Verbitsky, Oleg ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b IVAN FRANKO NATIONAL UNIVERSITY OF LVIV   (Ukraine)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036998523     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-002-0001-0     Document Type: Article

References (25)

1. N. ALON: Probabilistic methods in extremal finite set theory, in: Extremal Problems for Finite Sets, (P. Frankl, Z. Füredi, G. O. H. Katona and D. Miklós Eds.), Bolyai Society Mathematical Studies,3, Visegrád, Hungary, 1991, 39-57, 1991.
2. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, M. SZEGEDY: Proof verification and the hardness of approximation problems, Journal of the ACM, 45(3) (1998), 501-555.
3. L. BABAI, L. FORTNOW, C. LUND: Non-deterministic exponential time has two-prover interactive protocols, Computational Complexity, 1 (1991), 3-40.
4. M. BELLARE, S. GOLDWASSER, C. LUND, A. RUSSELL: Efficient probabilistic checkable proofs and applications to approximation, Proc. of 25th Annual Symposium on the Theory of Computing, 294-304, 1993.
5. M. BELLARE, O. GOLDREICH, M. SUDAN: Free bits, PCPs and non-approximability - towards tight results, SIAM J. Comput., 27(3) (1998), 804-915.
6. M. BEN-OR, S. GOLDWASSER, J. KILIAN, A. WIGDERSON: Multi prover interactive proofs: how to remove intractability, Proc. of 20th Annual Symposium on the Theory of Computing, 113-131, 1988.
7. B. BOLLOBAS: Extremal graph theory, Academic Press, 1978.
8. J. CAI, A. CONDON, R. LIPTON: On games of Incomplete information, Theoretical Computer Science, 103(1) (1992), 25-38.
9. J. CAI, A. CONDON, R. LIPTON: PSPACE is provable by two provers in one round, Journal of Computer and System Sciences, 48(1) (1994), 183-193.
10. U. FEIGE: On the success probability of the two provers in one round proof systems, Proc. of 6th IEEE Symposium on Structure in Complexity Theory, 116-123, 1991.
11. U. FEIGE: Error reduction by parallel repetition - the state of the art, Technical report CS95-32 of the Weizmann Institute, 1995.
12. U. FEIGE, J. KILIAN: Two prover protocols - low error at affordable rates, SIAM J. Comput., 30(1) (2000), 324-346.
13. U. FEIGE, L. LOVASZ: Two-prover one-round proof systems, their power and their problems, Proc. of 24th Annual Symposium on the Theory of Computing, 733-744, 1992.
14. L. FORTNOW, J. ROMPEL, M. SIPSER: On the power of multi-prover interactive protocols, Theoretical Computer Science, 134(2) (1994), 545-557.
15. A. FURSTENBERG, Y. KATZNELSON: A density version of the Hales-Jewett theorem, Journal d'Analyse Mathematique, 57 (1991), 64-119.
16. S. GOLDWASSER, S. MICALI, C. RACKOFF: The knowledge complexity of interactive proof systems, SIAM J. Comp., 18(1) (1989), 186-208.
17. D. LAPIDOT, A. SHAMIR: A one-round, two-prover, zero-knowledge protocol for NP, Combinatorica, 15(2) (1995), 203-214.
18. D. LAPIDOT, A. SHAMTR: Fully parallelized multi prover protocols for NEXP-time, Journal of Computer and System Sciences, 54(2) (1997), 215-220.
19. C. LUND, M. YANNAKAKIS: On the hardness of approximating minimization problems, Journal of the ACM, 41(5) (1994), 960-981.
20. I. PARNAFES, R. RAZ, A. WIGDERSON: Direct product results and the GCD problem, in old and new communication models, Proc. of 29th Annual ACM Symposium on Theory of Computing, 363-372, 1997.
21. D. PELEG: On the maximum density of 0-1 matrices with no forbidden rectangles, Discrete Mathematics, 140 (1995), 269-274.
22. R. RAZ: A parallel repetition theorem, SIAM J. Comput., 27(3) (1998), 763-803.
23. O. VERBITSKY: Towards the parallel repetition conjecture, Theoretical Computer Science, 157(2) (1996), 277-282.
24. O. VERBITSKY: The parallel repetition conjecture for trees is true, Electronic Colloquium on Computational Complexity, TR95-013, 1995.
25. O. VERBITSKY: Remarks on a query-based variant of the parallel repetition theorem, International Journal of Foundations of Computer Science, 12(4) (2001), 517-532.