On the evolution of the worst-case OBDD size

Information Processing Letters

Volumn 77, Issue 1, 2001, Pages 1-7

  Gröpl, Clemens ^a   Prömel, Hans Jürgen ^a   Srivastav, Anand ^b  

^a HUMBOLDT UNIVERSITY   (Germany)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DECISION THEORY; THEOREM PROVING;

ORDERED BINARY DECISION DIAGRAMS (OBDD);

BOOLEAN FUNCTIONS;

EID: 0343338333     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00148-4     Document Type: Article

References (15)

1. Breitbart Y., Hunt III H., Rosenkrantz D. On the size of binary decision diagrams representing Boolean functions. Theoret. Comput. Sci. Vol. 145:1995;45-69.
2. Brace K.S., Rudell R.L., Bryant R.E. Efficient implementation of a BDD package. Proc. 27th Design Autom. Conf. 1990;40-45.
3. Bryant R.E. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. Vol. C-35:(8):1986;677-691.
4. Bryant R.E. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Comput. Surv. Vol. 24:(3):1992;293-318.
5. Gröpl C. Binary decision diagrams for random Boolean functions. Dissertation:1999;Humboldt Universität zu Berlin. Available via http://dochost.rz.hu-berlin.dc/docserv.html.
6. Gröpl C., Srivastav A., Prömel H.J. Size and structure of random ordered binary decision diagrams (Extended Abstract). Proc. 15th Symp. Theoret. Aspects of Computer Sci. Lecture Notes in Comput. Sci. Vol. 1373:1998;238-248 Springer, Berlin.
7. Gröpl C., Srivastav A., Prömel H.J. Size and structure of random ordered binary decision diagrams. Preprint, 30 pp. 2000.
8. Gergov J., Meinel C. Efficient Boolean manipulation with OBDDs can be extended to FBDDs. IEEE Trans. Comput. Vol. 43:(10):1994;1197-1209.
9. Heap M.A., Mercer M.R. Least upper bounds on OBDD sizes. IEEE Trans. Comput. Vol. 43:(6):1994;764-767.
10. Lee C.Y. Representation of switching circuits by binary decision programs. Bell System Techn. J. Vol. 38:1959;985-999.
11. Liaw H.-T., Lin C.-S. On the OBDD-representation of general Boolean functions. IEEE Trans. Comput. Vol. 41:(6):1992;661-664.
12. Shannon C.E. The synthesis of two-terminal switching circuits. Bell System Techn. J. Vol. 28:1949;59-98.
13. F. Somenzi, CUDD: Colorado University Decision Diagram Package, available via ftp://vlsi.colorado.edu/pub/.
14. Sieling D., Wegener I. Graph driven BDDs - A new data structure for Boolean functions. Theoret. Comput. Sci. Vol. 141:1995;283-310.
15. Wegener I. The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions. IEEE Trans. Comput. Vol. 43:(11):1994;1262-1269.