Conference
Probabilistically checkable proofs with low amortized query complexity
| Title: | Probabilistically checkable proofs with low amortized query complexity |
|---|---|
| Authors: | Sudan, M., Trevisan, L. |
| Source: | Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Foundations of computer science Foundations of Computer Science, 1998. Proceedings. 39th Annual Symposium on. :18-27 1998 |
| Relation: | Proceedings of 39th Annual Symposium on Foundations of Computer Science |
| ISSN: | 02725428 |
| DOI: | 10.1109/SFCS.1998.743425 |
| Database: | IEEE Xplore Digital Library |