A note on complexity of OBDD composition and efficiency of partitioned-OBDDs over OBDDs: 1289

Authors:
Jawarhar Jain;Ingo Wegener;Masahiro Fujita
Affiliations:
Fujitsu Labs of America, Sunnvale, CA;Univ. Dortmund, Dortmund, Germany;Univ. of Tokyo, Japan
Venue:
IEEE Transactions on Computers
Year:
2001

Citing 3
Cited 0

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Partitioned ROBDDs—a compact, canonical and efficiently manipulable representation for Boolean functions

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Decomposition Techniques for Efficient ROBDD Construction

FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design

Quantified Score

Hi-index	14.98

Visualization

Abstract

We discuss an open problem with constructing an OBDD using composition and prove that the worst case complexity of the construction is truly cubic. Using this insight, we show compactness of partitioned-OBDDs over monolithic OBDDs.