Efficient probabilistically checkable proofs and applications to approximations
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC ’93
C. Lund
S. Goldwasser
M. Bellare
Two prover protocols