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
The Number of Classes of Invertible Boolean Functions
Full text PdfPdf (157 KB)
Source Journal of the ACM (JACM) archive
Volume 10 ,  Issue 1  (January 1963) table of contents
Pages: 25 - 28  
Year of Publication: 1963
ISSN:0004-5411
Author
Michael A. Harrison  University of Michigan, Ann Arbor, Michigan
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 18,   Citation Count: 1
Additional Information:

references   cited by   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/321150.321152
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
Robert L. Ashenhurst, The application of counting techniques, Proceedings of the 1952 ACM national meeting (Pittsburgh), p.293-305, May 02-02, 1952, Pittsburgh, Pennsylvania  [doi>10.1145/609784.609825]
 
2
DE BuRUNT., N.G. Geterlization of Pdlya's fundamental Theorem in elmmerative combinatorial analysis. Koninklijke Nederlardse Ala&mie Van Weenschappcn {A}, 5, 2 (1959), 5.9-69.
 
3
HxRIsoN, M.A. The umber of transitivity sets of Boolean functions. Umiv. Michigan Techn. Noe 04879-3-T, June 1962.
 
4
LORRENS, C S. Invertible Boolean functions. Space-General Corp., Res. Memorandum No. 21, Jan. 1962; ray. versDsn, Juty 1962.
 
5
SZLEPIAN D. On the umber of syrmetry types of Boolean funetiots of n variables. Cnadian J. Mah. 5 (1953), 185-193.

CITED BY
Michael A. Harrison, On Asymptotic Estimates in Switching and Automata Theory, Journal of the ACM (JACM), v.13 n.1, p.151-157, Jan. 1966

INDEX TERMS

Primary 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

Additional Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.1 Numerical Algorithms and Problems
          Subjects: Number-theoretic computations (e.g., factoring, primality testing)


General Terms:
Measurement, Theory, Verification

Collaborative Colleagues:
Michael A. Harrison: 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