Simplification of a Class of Boolean Functions

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Simplification of a Class of Boolean Functions

Full text

Pdf (288 KB)

Source

Journal of the ACM (JACM) archive
Volume 5 , Issue 1 (January 1958) table of contents

Pages: 67 - 75

Year of Publication: 1958

ISSN:0004-5411

Author

Edwin Hirschhorn

Hughes Aircraft Co., Culver City, Calif. and Northrop Aircraft, Inc., Hawthorne, California

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references cited by index terms peer to peer

Tools and Actions:	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/320911.320920 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	E. W. Veitch, A chart method for simplifying truth functions, Proceedings of the 1952 ACM national meeting (Pittsburgh), p.127-133, May 02-02, 1952, Pittsburgh, Pennsylvania [doi>10.1145/609784.609801]
	2	KARN,~CO~, M.: Map Methods for Synthesis of Logic Circuits. Electrical Enyineering 1954, 73, p. 136.
	3	BIa~rHOFF, G. AND McLANE, S.: A Survey of Modern Algebra, 1951, MacMillan.

CITED BY 2

	Lewis T. Reinwald , Richard M. Soland, Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time, Journal of the ACM (JACM), v.13 n.3, p.339-358, July 1966
	Udo W. Pooch, Translation of Decision Tables, ACM Computing Surveys (CSUR), v.6 n.2, p.125-151, June 1974