| | This Article | |
| |
| |
| | Share | |
| |
| |
| | Bibliographic References | |
| |
| |
| | Add to: | |
| |
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
| |
| | Search | |
| |
| |
| | |
39th Annual Symposium on Foundations of Computer Science
Probabilistically Checkable Proofs with Low Amortized Query Complexity
Palo Alto, California
November 08-November 11
ISBN: 0-8186-9172-7
Citation:
M. Sudan, L. Trevisan, "Probabilistically Checkable Proofs with Low Amortized Query Complexity," focs, pp.18, 39th Annual Symposium on Foundations of Computer Science, 1998