The application of counting techniques

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The application of counting techniques

Full text

Pdf (841 KB)

Source

ACM Annual Conference/Annual Meeting archive
Proceedings of the 1952 ACM national meeting (Pittsburgh) table of contents

Pittsburgh, Pennsylvania

Pages: 293 - 305

Year of Publication: 1952

Author

Robert L. Ashenhurst

Harvard Computation Laboratory

Sponsors

ACM: Association for Computing Machinery
: Mellon Institute

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 12, Citation Count: 1

Additional Information:

references cited by collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/609784.609825 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	Synthesis of Electronic Computing and Control Circuits, Annals of the Computation Laboratory, Harvard University, Volume XXVII; Cambridge: Harvard University Press (1951).
	2	G. Polya, "Sur les types des propositions composees," Journal of Symbolic Logic, V. 5, p.98-103 (1940).
	3	D. Slepian, "Detailed enumeration of the number of types of Boolean (or switching) functions of n variables," unpublished memorandum on file at the Bell Telephone Laboratories.

CITED BY

Michael A. Harrison, The Number of Classes of Invertible Boolean Functions, Journal of the ACM (JACM), v.10 n.1, p.25-28, Jan. 1963

Collaborative Colleagues:

Robert L. Ashenhurst: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player