Statistical Complexity of Algorithms for Boolean Function Minimization

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Franco Mileto Olivetti Electronic Research Laboratory, Milan, Italy
Gianfranco Putzolu Olivetti Electronic Research Laboratory, Milan, Italy
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 12 Issue 3, July 1965
Pages 364-375
ACM New York, NY, USA
table of contents doi>10.1145/321281.321287
Statistical Complexity of Algorithms for Boolean Function Minimization Published by ACM 1965 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 13
· Downloads (cumulative): 316
· Citation Count: 3


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