The Computational Complexity of a Class of Minimization Algorithms for Switching Functions

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 pr...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on computers 1979-12, Vol.C-28 (12), p.941-943
Hauptverfasser:	Breitbart, Vairavan
Format:	Artikel
Sprache:	eng
Schlagworte:	Complexity implicants minimization algorithms useful prime
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!