The Community for Technology Leaders
Green Image
Issue No. 12 - December (1979 vol. 28)
ISSN: 0018-9340
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.
useful prime, Complexity, implicants, minimization algorithms
K. Vairavan, Y. Breitbart, "The Computational Complexity of a Class of Minimization Algorithms for Switching Functions", IEEE Transactions on Computers, vol. 28, no. , pp. 941-943, December 1979, doi:10.1109/TC.1979.1675286
101 ms
(Ver 3.3 (11022016))