SIGN IN
SIGN UP
Algebrization: A New Barrier in Complexity Theory
Full Text:
Pdf
Buy this Article
Authors:
Scott Aaronson
MIT
Avi Wigderson
Institute for Advanced Study
Published in:
· Journal
ACM Transactions on Computation Theory (TOCT)
TOCT Homepage
archive
Volume 1 Issue 1, February 2009
Article No. 2
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1490270.1490272
2009 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 18
· Downloads (12 Months): 113
· Downloads (cumulative): 1,033
· Citation Count: 4
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
arithmetization
communication complexity
computation by abstract devices
interactive proofs
low-degree polynomials
oracles
query complexity
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