A Reduction Technique for Prime Implicant Tables
- 1 August 1965
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers
- Vol. EC-14 (4) , 535-541
- https://doi.org/10.1109/pgec.1965.263993
Abstract
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 exactly two rows.Keywords
This publication has 6 references indexed in Scilit:
- A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant TableIEEE Transactions on Electronic Computers, 1965
- An Essay on Prime Implicant TablesJournal of the Society for Industrial and Applied Mathematics, 1961
- An application of linear programming to the minimization of Boolean functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1961
- Minimization of Boolean Functions*Bell System Technical Journal, 1956
- A Way to Simplify Truth FunctionsThe American Mathematical Monthly, 1955
- The Problem of Simplifying Truth FunctionsThe American Mathematical Monthly, 1952