On non-linear lower bounds in computational complexity

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Leslie G. Valiant
Published in:
· Proceeding
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Pages 45-53
ACM New York, NY, USA ©1975
table of contents doi>10.1145/800116.803752
On non-linear lower bounds in computational complexity Published by ACM 1975 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 43
· Downloads (cumulative): 406
· Citation Count: 21


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder