loading...
 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
ASCII Text
x 
 
M. Sudan, L. Trevisan, "Probabilistically Checkable Proofs with Low Amortized Query Complexity," Foundations of Computer Science, IEEE Annual Symposium on, pp. 18, 39th Annual Symposium on Foundations of Computer Science, 1998.
 
 
BibTex
x
 
@article{ 10.1109/SFCS.1998.743425,
author = {M. Sudan and L. Trevisan},
title = {Probabilistically Checkable Proofs with Low Amortized Query Complexity},
journal ={Foundations of Computer Science, IEEE Annual Symposium on},
volume = {0},
year = {1998},
issn = {0272-5428},
pages = {18},
doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1998.743425},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Foundations of Computer Science, IEEE Annual Symposium on
TI - Probabilistically Checkable Proofs with Low Amortized Query Complexity
SN - 0272-5428
SP
EP
A1 - M. Sudan,
A1 - L. Trevisan,
PY - 1998
VL - 0
JA - Foundations of Computer Science, IEEE Annual Symposium on
ER -
 
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
Usage of this product signifies your acceptance of the Terms of Use.