A note on PCP vs. MIP

Information Processing Letters

Volumn 58, Issue 3, 1996, Pages 135-140

  Ta Shma, Amnon ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Algorithms; Complexity; Interactive proof system

Indexed keywords

EID: 0542409691     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00043-9     Document Type: Article

References (7)

1. S. Arora and S. Safra, Probabilistic checking of proofs; a new characterization of NP, in: Proc. 33rd Ann. IEEE Symp. on the Foundations of Computer Science ( 1992) 2-13.
2. M. Bellare, O. Goldreich and S. Safra, Private communication.
3. M. Bellare, S. Goldwasser, C. Lund and A. Russell, Efficient probabilistically checkable proofs and applications to approximation, in: Proc. 25th Ann. ACM Symp. on the Theory of Computing (1993) 294-304.
4. M. Ben-Or, S. Goldwasser, J. Killian and A. Wigderson, Multi-prover interactive proofs: how to remove intractability assumptions, in: Proc. 20th Ann. ACM Symp. on the Theory of Computing (1988) 113-131.
5. U. Feige and L. Lovasz, Two-prover one round proof systems: their power and their problems, in: Proc. 24th Ann. ACM Symp. on the Theory of Computing (1992).
6. L. Fortnow, J. Rompel and M. Sipser, On the power of multi-prover interactive protocols, in: Proc. 3rd Structures Theory of Computing (1988).
7. D. Lapidot and A. Shamir, Fully parallelized multi-prover protocols for NEXPtime, in: Proc. 32rd Ann. IEEE Symp. on the Foundations of Computer Science (1991) 13-18.