This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
3rd Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1962)
Minimal Boolean expressions with more than two levels of sums and products
Chicago, Ill
October 07-October 12
This paper presents a new approach to the problem of multi-level Boolean minimization. Conventional two-level minimization methods are embedded in a process that makes extensive use of the properties of incompletely specified functions. Particular attention is given to the problem of obtaining minimal sums-of-products-of-sums. Then the approach is extended to minimal expressions with more than three levels and to "absolute" minimal expressions. Several examples are worked out.
Citation:
Eugene L. Lawler, "Minimal Boolean expressions with more than two levels of sums and products," focs, pp.49-60, 3rd Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1962), 1962
Usage of this product signifies your acceptance of the Terms of Use.