On the Limits of Nonapproximability of Lattice Problems
Interactive proofs and the hardness of approximating cliques
The Knowledge Complexity of Interactive Proof Systems
Multi-prover interactive proofs: how to remove intractability
Journal of Computer and System Sciences
Journal of the ACM
SIAM Journal on Computing
Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC ’88
Shmuel Safra
Oded Goldreich
Joe Kilian
László Lovász
Avi Widgerson
Charles Rackoff
Beyond nash equilibrium
(Gap/S)ETH hardness of SVP
Guest column
Two prover protocols