Lower bounds for algebraic computation trees

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Michael Ben-Or
Published in:
· Proceeding
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Pages 80-86
ACM New York, NY, USA ©1983
table of contents ISBN:0-89791-099-0 doi>10.1145/800061.808735
Lower bounds for algebraic computation trees Published by ACM 1983 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 15
· Downloads (12 Months): 78
· Downloads (cumulative): 1,266
· Citation Count: 130


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