|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design
A reduction technique for prime implicant tables
November 11-November 13
| ASCII Text | x | ||
| James F. Gimpel, "A reduction technique for prime implicant tables," Foundations of Computer Science, IEEE Annual Symposium on, pp. 183-191, 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design, 1964. | |||
| BibTex | x | ||
| @article{ 10.1109/SWCT.1964.4, author = {James F. Gimpel}, title = {A reduction technique for prime implicant tables}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1964}, isbn = {}, pages = {183-191}, doi = {http://doi.ieeecomputersociety.org/10.1109/SWCT.1964.4}, 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 - A reduction technique for prime implicant tables SN - SP183 EP191 A1 - James F. Gimpel, PY - 1964 VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SWCT.1964.4
Solving prime implicant tables is greatly facilitated by reduction techniques such as row dominance, column dominance and essential row selection. This paper presents a new reduction technique which is operable on any otherwise irreducible table having a column covered by two rows.
Citation:
James F. Gimpel, "A reduction technique for prime implicant tables," focs, pp.183-191, 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design, 1964
Usage of this product signifies your acceptance of the Terms of Use.
