- Uriel Feige, Shafi Goldwasser, Laszlo Lovász, Shmuel Safra, and
Mario Szegedy. Interactive proofs and the
hardness of approximating cliques. Journal of the ACM,
43(2):268-292, March 1996.
- Sanjeev Arora and Shmuel Safra. Probabilistic checking of proofs: A
new characterization of NP. Journal of the ACM,
45(1):70-122, January 1998.