|
| 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
| ASCII Text | x | ||
| N.N. Necula, "An Algorithm for the Automatic Approximate Minimization of Boolean Functions," IEEE Transactions on Computers, vol. 17, no. 8, pp. 770-782, August, 1968. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1968.229160, author = {N.N. Necula}, title = {An Algorithm for the Automatic Approximate Minimization of Boolean Functions}, journal ={IEEE Transactions on Computers}, volume = {17}, number = {8}, issn = {0018-9340}, year = {1968}, pages = {770-782}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1968.229160}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - An Algorithm for the Automatic Approximate Minimization of Boolean Functions IS - 8 SN - 0018-9340 SP770 EP782 EPD - 770-782 A1 - N.N. Necula, PY - 1968 KW - Index Terms?Approximate minimization algorithms KW - automatic generation KW - Boolean functions KW - essential prime implicants KW - irredundant normal forms. VL - 17 JA - IEEE Transactions on Computers ER - | |||
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.