
doi: 10.1007/bf00991179
Solving the minimal covering problem by an implicit enumeration method is discussed. The implicit enumeration method in this paper is a modification of the Quine-McCluskey method tailored to computer processing and also its extension, utilizing some new properties of the minimal covering problem for speedup. A heuristic algorithm is also presented to solve large-scale problems. Its application to the minimization of programmable logic arrays (i.e., PLAs) is shown as an example. Computational experiences are presented to confirm the improvements by the implicit enumeration method discussed.
logic minimization, Switching theory, application of Boolean algebra; Boolean functions, heuristic algorithm, Integer programming, implicit enumeration method, minimal sum, heuristic minimization, Quine-McCluskey method, minimization of programmable logic arrays
logic minimization, Switching theory, application of Boolean algebra; Boolean functions, heuristic algorithm, Integer programming, implicit enumeration method, minimal sum, heuristic minimization, Quine-McCluskey method, minimization of programmable logic arrays
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
