Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,Software
Reference56 articles.
1. S. Arora, B. Barak. Computational Complexity: A Modern Approach (Cambridge University Press, Cambridge, UK, 2009). A draft is available at http://theory.cs.princeton.edu/complexity/book.pdf.
2. W. Aiello, S.N. Bhatt, R. Ostrovsky, S. Rajagopalan, Fast verification of any remote procedure call: Short witness-indistinguishable one-round proofs for NP, in U. Montanari, J.D.P. Rolim, E. Welzl, editors, ICALP 2000, volume 1853 of LNCS (Springer, Heidelberg, 2000), pp. 463–474
3. P. Ananth, Y.-C. Chen, K.-M. Chung, H. Lin, W.-K. Lin, Delegating RAM computations with adaptive soundness and privacy, in M. Hirt, A.D. Smith, editors, TCC 2016-B, Part II, volume 9986 of LNCS (Springer, Heidelberg, 2016), pp. 3–30
4. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and the hardness of approximation problems. J. ACM, 45(3):501–555 (1998)
5. S. Arora, S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45(1):70–122 (1998)