SIGN IN
SIGN UP
Algebrization: a new barrier in complexity theory
Full Text:
PDF
Buy this Article
Authors:
Scott Aaronson
MIT, Cambridge, MA, USA
Avi Wigderson
Institute for Advanced Study, Princeton, NJ, USA
Published in:
· Proceeding
STOC '08 Proceedings of the 40th annual ACM symposium on Theory of computing
Pages 731-740
ACM
New York, NY
, USA
©2008
table of contents
ISBN: 978-1-60558-047-0
doi>
10.1145/1374376.1374481
2008 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 29
· Downloads (cumulative): 401
· Citation Count: 10
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:
arithmetization
communication complexity
interactive proofs
low-degree polynomials
oracles
query complexity
relations among complexity classes
relativized computation
theory
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