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

Authors
Jain, J Wegener, I Fujita, M
Citation
J. Jain et al., A note on complexity of OBDD composition and efficiency of partitioned-OBDDs OBDDs, IEEE COMPUT, 50(11), 2001, pp. 1289-1290
Citations number
5
Categorie Soggetti
Computer Science & Engineering
Journal title
IEEE TRANSACTIONS ON COMPUTERS
ISSN journal
00189340 → ACNP
Volume
50
Issue
11
Year of publication
2001
Pages
1289 - 1290
Database
ISI
SICI code
0018-9340(200111)50:11<1289:ANOCOO>2.0.ZU;2-S
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. Us ing this Insight, we show compactness of partitioned-OBDDs over monolithic OBDDs.