ACM Home Page
Please provide us with feedback. Feedback
Generalized Tree Circuit—The Basic Building Block of an Extended Decomposition Theory
Full text PdfPdf (1.04 MB)
Source Journal of the ACM (JACM) archive
Volume 10 ,  Issue 4  (October 1963) table of contents
Pages: 562 - 581  
Year of Publication: 1963
ISSN:0004-5411
Author
H. Allen Curtis  Lewis Research Center, N.A.S.A., Cleveland, Ohio
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 20,   Citation Count: 2
Additional Information:

references   cited by   index terms  

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/321186.321202
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
 
2
----. A New Approach to the Design of Switching Circuits, pp. 466-500. D. Van Nostrand Co., Inc., Princeton (1962).
 
3
KAnt, R.M. Functional decomposition and switching circuit design. J. SIAM (1963).
 
4
ASHENHUST, R.L. The decomposition of switching functions. Proc. Internat. Syrup. Theory of Switching, 1959.
5
 
6
BIRKHOFF, G. Lattice Theory. Am. Math. Soc. Colloquium Publ. 25 (1948).
 
7
RoTH, J. P..AND KARP, R. M: Minimization over Boolean graphs. IBM J. Res. Dev. 6 (1962), 227-238.