Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Arora S., Lund C., Motwani R., Sudan M, and M. Szegedy, “Proof verification and intractability of approximation problems.” Proc. 33rd IEEE Symposium on Foundation of Computer Science, October 1992, pp. 14–23.
2. Arora S. and Safra S. “Probabilistic Checkable Proofs: A New Characterization of NP.” Proc. 33rd IEEE Symposium on Foundation of Computer Science, October 1992, pp. 1–13.
3. Babai L., Fortnow L, and Lund C. “Non-deterministic Exponential time has Two-Prover Interactive Protocols Proc. 31st IEEE Symposium on Foundation of Computer Science, October 1990, pp. 16–25.
4. Babai L., Fortnow L, Levin L, and Szegedy M. “Checking Computations in Polylogarithmic Time” Proc 23rd ACM Symposium on theory of computation, May 1991, pp 21–31.
5. Babai L. and Moran S. “Arthur-Merlin Games: A Randomized Proof System and a Hierarchy of Complexity Classes”, Journal of Computer and System Sciences, Vol 36, pp 254–276, 1988.