Issue No. 08 - August (1968 vol. 17)
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.
Index Terms?Approximate minimization algorithms, automatic generation, Boolean functions, essential prime implicants, irredundant normal forms.
N. Necula, "An Algorithm for the Automatic Approximate Minimization of Boolean Functions," in IEEE Transactions on Computers, vol. 17, no. , pp. 770-782, 1968.