- Sanjeev Arora and Shmuel Safra. Probabilistic checking of proofs: A
new characterization of NP. Journal of the ACM,
45(1):70-122, January 1998.
- 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.