Title :
The complexity of the inclusion operation on OFDD´s
Author :
Drechsler, Rolf ; Sauerhoff, Martin ; Sieling, Detlef
Author_Institution :
Inst. of Comput. Sci., Albert-Ludwigs-Univ., Freiburg, Germany
fDate :
5/1/1998 12:00:00 AM
Abstract :
Ordered functional decision diagrams (OFDD´s) are a data structure for representation and manipulation of Boolean functions. A polynomial time algorithm for the test whether f⩽g for functions f and g given by OFDD´s is presented. This is the last basic operation on OFDD´s whose complexity was unknown. The result also solves an open question on the complexity of minimizing OFDD´s for incompletely specified functions
Keywords :
Boolean functions; computational complexity; data structures; Boolean functions; OFDDs; complexity; data structure; inclusion operation; incompletely specified functions; ordered functional decision diagrams; polynomial time algorithm; Boolean functions; Circuit synthesis; Computer science; Data structures; Logic circuits; Performance evaluation; Polynomials; Testing;
Journal_Title :
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
