Proof verification and hardness of approximation problems
Nondeterministic exponential time has two-prover interactive protocols
Efficient probabilistically checkable proofs and applications to approximations
Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
Proceedings., 33rd Annual Symposium on Foundations of Computer Science
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC ’93
R. Motwani
M. Sudan
S. Arora
M. Bellare
S. Goldwasser
A. Russeli
Two prover protocols