Algebraic methods in the theory of lower bounds for Boolean circuit complexity

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: R. Smolensky Department of Mathematics, University of California, Berkeley
Published in:
· Proceeding
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Pages 77-82
ACM New York, NY, USA ©1987
table of contents ISBN:0-89791-221-7 doi>10.1145/28395.28404
Algebraic methods in the theory of lower bounds for Boolean circuit complexity Published by ACM 1987 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 17
· Downloads (12 Months): 123
· Downloads (cumulative): 1,160
· Citation Count: 101


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