|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| 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
| ASCII Text | x | ||
| Eugene L. Lawler, "Minimal Boolean expressions with more than two levels of sums and products," Foundations of Computer Science, IEEE Annual Symposium on, pp. 49-60, 3rd Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1962), 1962. | |||
| BibTex | x | ||
| @article{ 10.1109/FOCS.1962.9, author = {Eugene L. Lawler}, title = {Minimal Boolean expressions with more than two levels of sums and products}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1962}, isbn = {}, pages = {49-60}, doi = {http://doi.ieeecomputersociety.org/10.1109/FOCS.1962.9}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - Minimal Boolean expressions with more than two levels of sums and products SN - SP49 EP60 A1 - Eugene L. Lawler, PY - 1962 VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.1962.9
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.
