- 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, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario
verification and the hardness of approximation problems.
Journal of the ACM, 45(3):501-555, May 1998.