This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Algorithm for the Automatic Approximate Minimization of Boolean Functions
August 1968 (vol. 17 no. 8)
pp. 770-782
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:
Index Terms?Approximate minimization algorithms, automatic generation, Boolean functions, essential prime implicants, irredundant normal forms.
Citation:
N.N. Necula, "An Algorithm for the Automatic Approximate Minimization of Boolean Functions," IEEE Transactions on Computers, vol. 17, no. 8, pp. 770-782, Aug. 1968, doi:10.1109/TC.1968.229160
Usage of this product signifies your acceptance of the Terms of Use.