Interactive proofs and the hardness of approximating cliques
Two-prover one-round proof systems
Journal of the ACM
Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC ’92
László Lovász
Shafi Goldwasser
Mario Szegedy
Shmuel Safra
Guest column
Two prover protocols