IEEE Transactions on Electronic Computers · 1964 · 42 citations · 3 references
Natural SciencesComputer ScienceMathematicsCombinatoricsDiscrete MathematicsStatisticsBoolean AlgebraBoolean OperationsCombinatorial EnumerationComputational ComplexityComputational StatisticsEnumerative CombinatoricsBoolean Function MinimizationBoolean FunctionsBoolean MinimizationMinimizationMinimization Of Boolean Functions
In connection with the problem of two-level minimization of Boolean functions, we have obtained in a combinatorial way the formulas which give the following quantities of statistical interest: average numbers of k cubes, prime k cubes and essential k cubes of a Boolean function. The parameters which appear in our formulas are: number of variables, number of ``one'' vertices and number of ``don't care'' vertices.
3
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
The Problem of Simplifying Truth Functions
W. V. Quine · American Mathematical Monthly · 1952 · 434 citations