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

Authors:
M. Sauerhoff;I. Wegener
Affiliations:
Fachbereich Inf., Dortmund Univ.;-
Venue:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Year:
2006

Citing 0
Cited 7

Safe BDD minimization using don't cares

DAC '97 Proceedings of the 34th annual Design Automation Conference
Don't care-based BDD minimization for embedded software

DAC '98 Proceedings of the 35th annual Design Automation Conference
Automated Conversion and Simplification of Plan Representations

AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
BDD representation for incompletely specifiedvmultiple-output logic functions and its applications to functional decomposition

Proceedings of the 42nd annual Design Automation Conference
Synthesis of irregular combinational functions with large don't care sets

Proceedings of the 17th ACM Great Lakes symposium on VLSI
BDD Representation for Incompletely Specified Multiple-Output Logic Functions and Its Applications to the Design of LUT Cascades

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Finding small OBDDs for incompletely specified truth tables is hard

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.03

Visualization

Abstract

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