An Algorithm for the Automatic Approximate Minimization of Boolean Functions

Authors:
N. N. Necula
Affiliations:
-
Venue:
IEEE Transactions on Computers
Year:
1968

Citing 0
Cited 3

Generation of Prime Implicants by Direct Multiplication

IEEE Transactions on Computers
A New Algorithm for Generating Prime Implicants

IEEE Transactions on Computers
A Method for the Generation and Processing of Dyadic Indexed Data

IEEE Transactions on Computers

Quantified Score

Hi-index	14.99

Visualization

Abstract

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.