ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Corrigenda: "Statistical Complexity of Algorithms for Boolean Function Minimization"
Full text PdfPdf (55 KB)
Source Journal of the ACM (JACM) archive
Volume 13 ,  Issue 3  (July 1966) table of contents
Page: 469  
Year of Publication: 1966
ISSN:0004-5411
Authors
Franco Mileto  Olivetti General Electric Electronic Research Laboratory, Pregnana Milanese, Milan, Italy
Gianfranco Putzolu  Olivetti General Electric Electronic Research Laboratory, Pregnana Milanese, Milan, Italy
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 12,   Citation Count: 0
Additional Information:

index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/321341.321355
What is a DOI?

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS

Additional Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Computations on discrete structures


General Terms:
Algorithms, Measurement, Performance, Theory

Collaborative Colleagues:
Franco Mileto: colleagues
Gianfranco Putzolu: colleagues

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

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player