Issue No. 11 - November (2001 vol. 50)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.966501
<p><b>Abstract</b>—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.</p>
Partitioned-OBDDs, OBDDs, composition.
I. Wegener, J. Jain and M. Fujita, "A Note on Complexity of OBDD Composition and Efficiency of Partitioned-OBDDs over OBDDs," in IEEE Transactions on Computers, vol. 50, no. , pp. 1289-1290, 2001.