The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (2001 vol.50)
pp: 1289-1290
ABSTRACT
<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>
INDEX TERMS
Partitioned-OBDDs, OBDDs, composition.
CITATION
Jawahar Jain, Ingo Wegener, Masahiro Fujita, "A Note on Complexity of OBDD Composition and Efficiency of Partitioned-OBDDs over OBDDs", IEEE Transactions on Computers, vol.50, no. 11, pp. 1289-1290, November 2001, doi:10.1109/12.966501
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool