Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1853, Issue , 2000, Pages 187-198

  Bollig, Beate ^a   Wegener, Ingo ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS; BOOLEAN FUNCTIONS; COMPUTER AIDED DESIGN;

ASYMPTOTICALLY OPTIMAL; COMMON DYNAMICS; DETERMINISTIC FINITE AUTOMATA; ORDERED BINARY DECISION DIAGRAMS; REPRESENTATION TYPE; VERIFICATION- , MODELING;

MODEL CHECKING;

EID: 84974589142     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_16     Document Type: Conference Paper

References (15)

1. Ajtai, M. (1999). A non-linear time lower bound for Boolean branching programs. 40. FOCS, 60-70.
2. Bollig, B. and Wegener, I. (1996). Improving the variable ordering of OBDDs is NP-complete. IEEE Trans. on Computers 45(9), 993-1002.
3. Bollig, B. and Wegener, I. (1999). Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems. Electronic Colloquium on Computational Complexity (ECCC), Report # TR99-048.
4. Bryant, R. E. (1986). Graph-based algorithms for Boolean manipulation. IEEE Trans. on Computers 35, 677-691.
5. Hromkovič, J. (1997). Communication Complexity and Parallel Computing. Springer.
6. Kovari, T. Sós, V., and Turán, P. (1954). On a problem of K. Zarankiewicz. Colloquium Mathematicum 3, 50-57.
7. Kushilevitz, E. and Nisan, N. (1997). Communication Complexity. Cambridge University Press.
8. Minato, S. (1993). Zero-suppressed BDDs for set manipulation in combinatorial problems. 30. DAC, 272-277.
9. Ochi, H., Yasuoka, K., and Yajima, S. (1993). Breadth-first manipulation of very large binary-decision diagrams. ICCAD '93, 48-55.
10. Rudell, R. (1993). Dynamic variable ordering for ordered binary decision diagrams. ICCAD '93, 42-47.
11. Sieling, D. (1998). On the existence of polynomial time approximation schemes for OBDD minimization. STACS '98, LNCS 1373, 205-215.
12. Sieling, D. and Wegener, I. (1993). NC-algorithms for operations on binary decision diagrams. Parallel Processing Letters 48, 139-144.
13. Somenzi, F. (1998). CUDD: CU decision diagram package release 2.3.0. Techn. Rep. of the University of Colorado at Boulder.
14. Wegener, I. (1987). The Complexity of Boolean Functions. Wiley-Teubner.
15. Wegener, I. (2000). Branching Programs and Binary Decision Diagrams - Theory and Applications. SIAM Monographs in Discrete Mathematics and Applications.