Two-prover one-round proof systems: their power and their problems (extended abstract)
Uriel Feige, László Lovász
We characterize the power of two-prover one-round (MIP(2,1)) proof systems, showing that MIP(2,1)=NEXPTIME. However, the following intriguing question remains open: Does parallel repetition decrease the error probability of MIP(2,1) proof systems?.
ACM Symposium on Theory of Computing (STOC)•Jan 1, 1992•177 citations