IEEE Transactions on Computers · 1970 · 59 citations · 10 references
ComputingComputer ScienceAlgorithmsData StructuresTheory Of ComputationBoolean AlgebraRecursion TheoryBoolean Function MinimizationBoolean Function RepresentationCanonical Form ComputationNormal Form RepresentationOperatorsRecursionRecursive Functions
A common recursive formulation is presented for determining: 1) all the prime implicants, and 2) an irredundant normal form of any completely or incompletely specified Boolean function given in canonical form. Formulas for specific operators Pi and lrr2 solving these problems are given and recursive partitioned list algorithms are described for them. The solution of both of the above problems through recursive partitioned list algorithms is significantly faster than through the corresponding nonrecursive algorithms.
10
Minimization of Boolean Functions*
E.J. McCluskey · Bell System Technical Journal · 1956 · 1.2K citations
The Problem of Simplifying Truth Functions
W. V. Quine · American Mathematical Monthly · 1952 · 801 citations
A Way to Simplify Truth Functions
W. V. Quine · American Mathematical Monthly · 1955 · 572 citations
Humanities, Mathematics, Logic +6