This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Computational Complexity of a Class of Minimization Algorithms for Switching Functions
December 1979 (vol. 28 no. 12)
pp. 941-943
Y. Breitbart, Department of Electrical Engineering and Computer Science, University of Wisconsin
Most minimization algorithms produce an irredundant sum of products by first generating all prime implicants of a switching function. In this note we show that such an approach can be a wasteful one for an already complex problem. Specifically we show that there are functions for which the useful prime implicants form an extremely small fraction of all prime implicants, where we define a prime implicant to be useful if there is at least one irredundant sum of products which includes it.
Index Terms:
useful prime, Complexity, implicants, minimization algorithms
Citation:
Y. Breitbart, K. Vairavan, "The Computational Complexity of a Class of Minimization Algorithms for Switching Functions," IEEE Transactions on Computers, vol. 28, no. 12, pp. 941-943, Dec. 1979, doi:10.1109/TC.1979.1675286
Usage of this product signifies your acceptance of the Terms of Use.