Fully Parallelized Multi-prover Protocols for NEXP-Time

Journal of Computer and System Sciences

Volumn 54, Issue 2, 1997, Pages 215-220

  Lapidot, Dror ^a   Shamir, Adi ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

HIERARCHICAL SYSTEMS; NETWORK PROTOCOLS; PARALLEL PROCESSING SYSTEMS; PROBABILITY; THEOREM PROVING;

MULTIPROVER PROTOCOLS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0031122054     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1238     Document Type: Article

References (14)

1. L. Babai, Trading group theory for randomness, in "Proceedings, 17th STOC, 1985."
2. L. Babai, L. Fortnow, and C. Lund, Non-deterministic exponential time has two prover interactive protocols, J. Comput. Complexity 1, No. 1 (1991), 3-40; preliminary version in "Proceedings, 31st FOCS, 1990."
3. L. Babai, L. Fortnow, and C. Lund, Non-deterministic exponential time has two prover interactive protocols, J. Comput. Complexity 1, No. 1 (1991), 3-40; preliminary version in "Proceedings, 31st FOCS, 1990."
4. M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson, Multiprover interactive proofs: How to remove intractability assumptions, in "Proceedings, 20th STOC, 1988."
5. R. Boppana, J. Hastad, and S. Zachos, Does co-NP have short interactive proofs?, Inform. Process. Lett. 25 (1987), 127-132.
6. J. Y. Cai, A. Condon, and R. Lipton, PSPACE is provable by two provers in one round, in Proceedings, Structures in Complexity Theory Conf. 1991."
7. L. Fortnow, Ph.D. thesis, MIT.
8. U. Feige, On the success probability of the two provers in one round proof systems, in "Proceedings, Structures in Complexity Theory Conf. 1991."
9. L. Fortnow, J. Rompel, and M. Sipser, On the power of multi-prover interactive protocols, in "Proceedings, Structure in Complexity Theory Conf. 1988."
10. S. Goldwasser, S. Micali, C. Rackoff, The knowledge complexity of interactive proof systems, SIAM J. Compt. 18, No. 1 (1989), 186-208; preliminary version in "Proceedings, 17th STOC, 1986," pp. 291-304.
11. S. Goldwasser, S. Micali, C. Rackoff, The knowledge complexity of interactive proof systems, SIAM J. Compt. 18, No. 1 (1989), 186-208; preliminary version in "Proceedings, 17th STOC, 1986," pp. 291-304.
12. J. Kilian, Interactive proofs based on the speed of light, E-mail announcement, 1991.
13. C. Lund, L. Fortnow, H. Karloff, and N. Nisan, Algebraic methods for interactive proof system, in "Proceedings, 31st FOCS, 1990."
14. A. Shamir, IP = PSPACE, in "Proceedings, 31 st FOCS, 1990."