Author:
Goldreich Oded,Safra Shmuel
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. The Electronic Colloquium on Computational Complexity, ECCC, is a new forum for the rapid and widespread interchange of ideas in computational complexity. Online access to ECCC is possible using http://WWW.eccc.uni-trier.de/eccc/.
2. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof Verification and Intractability of Approximation Problems. In 33rd FOCS, pages 14–23, 1992.
3. S. Arora and S. Safra. Probabilistic Checkable Proofs: A New Characterization of NP. In 33rd FOCS, pages 1–13, 1992.
4. L. Babai. Transparent Proofs and Limits to Approximation. TR-94-07, Dept. of Computer Science, University of Chicago, 1994.
5. L. Babai, L. Fortnow, and C. Lund. Non-Deterministic Exponential Time has Two-Prover Interactive Protocols. In 31st FOCS, pages 16–25, 1990.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献