SIGN IN
SIGN UP
Quantum lower bounds by quantum arguments
Full Text:
PDF
Buy this Article
Author:
Andris Ambainis
Computer Science Division, University of California, Berkeley, CA
Published in:
· Proceeding
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Pages 636-643
ACM
New York, NY
, USA
©2000
table of contents
ISBN:1-58113-184-4
doi>
10.1145/335305.335394
2000 Article
Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 24
· Downloads (cumulative): 397
· Citation Count: 19
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
computations on discrete structures
design
management
performance
query processing
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