Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference33 articles.
1. Sanjeev Arora, Carsten Lund, Rajeev Motwani, MadhuSudan Mario Szegedy (1998) Proof verification and Intractability of Approximation Problems. Journal of ACM 45(3): 501–555 Preliminary version in FOCS 1992
2. Sanjeev Arora, Shmuel Safra (1998) Probabilistic Checkable Proofs: A New Characterization of NP. Journal of ACM volume 45(1): 70–122 Preliminary version in FOCS 1992
3. László Babai, Lance Fortnow, Leonid A. Levin & Mario Szegedy (1991). Checking Computations in Polylogarithmic Time. In STOC, 21–31.
4. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil Vadhan (2006) Robust PCPs of Proximity, Shorter PCPs and Applications to Coding. SIAM Journal of Computing 36(4): 120–134
5. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan & Salil P. Vadhan (2005). Short PCPs Verifiable in Polylogarithmic Time. In IEEE Conference on Computational Complexity, 120–134.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献