An Algorithm for the Automatic Approximate Minimization of Boolean Functions

1 August 1968

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. C-17 (8) , 770-782
https://doi.org/10.1109/TC.1968.229160

Abstract

—There are several algorithms that determine directly an irredundant normal form (INF) of a Boolean function without generating the entire set of prime implicants. These algorithms can generate solutions for the minimization problem much more rapidly than the algorithms determining minimum normal forms (MNF), and the cost of these solutions is, in many cases, very close to the minimum.

Keywords

FUNCTION
ALGORITHMS
MINIMIZATION
PRIME
INF
BOOLEAN
RAPIDLY
IRREDUNDANT
DIRECTLY
ABSTRACT&MDASH

This publication has 0 references indexed in Scilit: