On the complexity of minimizing the OBDD size for incompletely specified functions

The problem of constructing an OBDD cover of minimal size for an incompletely specified Boolean function arises in several applications in the CAD domain, e.g., the verification of sequential machines and the construction of OBDD's for incompletely specified circuits. The complexity of this pro...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on computer-aided design of integrated circuits and systems 1996-11, Vol.15 (11), p.1435-1437
Hauptverfasser:	Sauerhoff, M., Wegener, I.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Approximation algorithms Automata Binary decision diagrams Boolean functions Circuits Data structures Design. Technologies. Operation analysis. Testing Electronics Exact sciences and technology Heuristic algorithms Integrated circuits Minimization Polynomials Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	The problem of constructing an OBDD cover of minimal size for an incompletely specified Boolean function arises in several applications in the CAD domain, e.g., the verification of sequential machines and the construction of OBDD's for incompletely specified circuits. The complexity of this problem is determined. The decision problem is NP-complete. Efficient approximation algorithms exist only if NP=P.
ISSN:	0278-0070 1937-4151
DOI:	10.1109/43.543775