SIGN IN
SIGN UP
Recycling queries in PCPs and in linearity tests (extended abstract)
Full Text:
PDF
Buy this Article
Author:
Luca Trevisan
MIT Laboratory for Computer Science, Room NE43-371, 545 Technology Square, Cambridge, MA
Published in:
· Proceeding
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Pages 299-308
ACM
New York, NY
, USA
©1998
table of contents
ISBN:0-89791-962-9
doi>
10.1145/276698.276769
1998 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 8
· Downloads (cumulative): 184
· Citation Count: 16
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
algorithms
complexity measures and classes
graph algorithms
probabilistic computation
theory
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder