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
On a Computer Program for Obtaining Irreducible Representations for Two-Level Multiple Input-Output Logical Systems
Full text PdfPdf (1.37 MB)
Source Journal of the ACM (JACM) archive
Volume 10 ,  Issue 1  (January 1963) table of contents
Pages: 48 - 77  
Year of Publication: 1963
ISSN:0004-5411
Authors
R. W. House  Battelle Memorial Institute, Columbus, Ohio
T. Rado  The Ohio State University, and Battelle Memorial Institute, Columbus, Ohio
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 16,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues   peer to peer  

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.321154
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
McCvSKE, JR, E.J. Minimal sums for Boolean functions having many unspecified fund,menal products, Prec. Second Annual Snposhnn on Switching Circuit Theory and Logical Design, AIEE I"M1 General Meeting, Detroit, Mich., Oct. 17-20, I961, 10-17.
 
2
BaTEE, "T. C. Computer design of multiple-output logical networks. IRE Trans. EC-IO (Mr. 1961), 21-30.
 
3
MmSLEa, D.E. Application of Boolean algebra to switching circuit design and to error detection. IRE Trans. EC-3 (Sept. 1954), 6-12.
 
4
GHAZALA (GAZAI,), M.J. trredundant disjunctive and conjunctive forms of a BooIean function. IBM J. Res. Dev. t (Apr. 1957), 171-176.
 
5
RAPe, T. OT the presence function of Gazald. IBM J. Res. Dev. 6 (Apr. 1962).
 
6
IIovs, R. W..ND R,DO, T. A reduction lgorithm for iacompleteIy specified functions. To ppear.
 
7
Ibid.
 
8
QvlNE W.V. On cores and prime implicants of truth functions. Amer. Math. Month. 66 (Nov. 1959), 755-760.

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES
      F.4.1 Mathematical Logic
          Subjects: Logic and constraint programming

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:
Measurement, Performance, Theory, Verification

Collaborative Colleagues:
R. W. House: colleagues
T. Rado: colleagues

Peer to Peer - Readers of this Article have also read:

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