Parallel repetition: Simplifications and the no-signaling case

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 411-419

  Holenstein, Thomas ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

Parallel repetition; Probabilistically checkable proofs

Indexed keywords

PARALLEL REPETITION; PROBABILISTICALLY CHECKABLE PROOFS;

COMPUTATION THEORY; COMPUTATIONAL METHODS; PROBABILITY;

GAME THEORY;

EID: 35448934885     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250852     Document Type: Conference Paper

References (21)

1. P. Beame. Personal communication, 2006.
2. M. Ben-Or, S. Goldwasser, J. Kilián, and A. Wigderson. Multi-prover interactive proofs: How to remove intractability assumptions. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 113-132, 1988.
3. G. Brassard, A. Broadbent, and A. Tapp. Quantum pseudo-telepathy. Foundations of Physics, 35(11):1877-1907, 2005. (quant-ph/0407221).
4. J. Cai, A. Condon, and R. J. Lipton. On games of incomplete information. Theoretical Computer Science, 103(1):25-38, 1992.
5. B. S. Cirel'son. Quantum generalizations of Bell's inequality. Letters in Mathematical Physics, 4(2):93-100, 1980.
6. J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt. Proposed experiment to test local hidden-variable theories. Physical Review Letters, 23(15):880-884, 1969.
7. R. Cleve, W. Slofstra, F. Unger, and S. Upadhyay. Strong parallel repetition theorem for quantum XOR proof systems, 2006. (quant-ph/0608146).
8. T. M. Cover and J. A. Thomas. Elements of Information Theory. John Wiley & Sons, Inc., first edition, 1991. ISBN 0-471-06259-6.
9. U. Feige. On the success probability of the two provers in one-round proof systems. In Proceedings of the sixth Annual Structure in Complexity Theory Conference, pages 116-123, 1991.
10. U. Feige and L. Lovász. Two-prover one-round proof systems: Their power and their problems. In Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, pages 733-744, 1992.
11. U. Feige and O. Verbitsky. Error reduction by parallel repetition - a negative result. Combinatorica, 22(4):461-478, 2002.
12. L. Fortnow. Complexity-Theoretic Aspects of Interactive Proof Systems. PhD thesis, Massachusetts Institute of Technology, 1989.
13. L. Fortnow, J. Rompel, and M. Sipser. On the power of multi-prover interactive proof systems. heoretical Computer Science, 134(21):545-557, 1994.
14. T. Holenstein and R. Renner. On the randomness of independent experiments, 2006. (cs.IT/0608007).
15. D. Lapidot and A. Shamir. A one-round, two-prover, zero-knowledge protocol for NP. Combinatorica, 15(2):204-214, 1995.
16. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, first edition, 2000. ISBN 0-521-63503-9.
17. I. Parnafes, R. Raz, and A. Wigderson. Direct product results and the GCD problem, in old and new communication models. In Proceedings of the Twenty-Ninth Annual A CM Symposium on Theory of Computing, pages 363-372, 1997.
18. S. Popescu and D. Rohrlich. Nonlocality as an axiom for quantum theory. Foundations of Physics, 24(3):379-385, March 1994. (quant-ph/9508009).
19. R. Raz. A parallel reptition theorem. SIAM Journal on Computing, 27(3):763-803, 1998.
20. O. Verbitsky. Towards the parallel repetition conjecture. In Structure in Complexity Theory Conference, pages 304-307, 1994.
21. J. Watrous. A note on parallel repetition of two-prover quantum-interactive proofs, 2002. Manuscript.