Ordered binary decision diagrams and the Shannon effect

Discrete Applied Mathematics

Volumn 142, Issue 1-3 SPEC. ISS., 2004, Pages 67-85

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

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b HUMBOLDT UNIVERSITY   (Germany)

^c UNIVERSITY OF KIEL   (Germany)

Author keywords

Binary decision diagram; Boolean function; Probabilistic analysis; Shannon effect

Indexed keywords

APPROXIMATION THEORY; DECISION THEORY; HEURISTIC METHODS; PROBABILITY; PROBLEM SOLVING; SET THEORY; TREES (MATHEMATICS);

BINARY DECISION DIAGRAMS; PROBABILISTIC ANALYSIS; SHANNON EFFECTS;

BOOLEAN FUNCTIONS;

EID: 18544410180     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2003.02.003     Document Type: Article

References (29)

1. Alon N., H. Spencer Joel The Probabilistic Method. 1991;Wiley, New York.
2. B. Becker, R. Drechsler, M. Theobald, OKFDDs versus OBDDs and OFDDs; International Colloquium on Automata, Languages and Programming, Springer, Lecture Notes on Computer Science 944, 1995, pp. 475-486.
3. Becker B., Drechsler R., Werchner R. On the Relation Between BDDs and FDDs. Inform. and Comput. 123(2):1995;185-197.
4. K.S. Brace, R.L. Rudell, R.E. Bryant, Efficient implementation of a BDD package; Proceedings of the 27th Design Automation Conference, 1990, 40-45.
5. Breitbart Y., Hunt III H., Rosenkrantz D. On the size of binary decision diagrams representing boolean functions. Theoret. Comput. Sci. 145:1995;45-69.
6. Bryant R.E. Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. C-35(8):1986;677-691.
7. Bryant R.E. On the complexity of VLSI implementations and graph representations of boolean functions with application to integer multiplication. IEEE Trans. Comput. C-40:1991;205-213.
8. Bryant R.E. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Comput. Surveys. 24(3):1992;293-318.
9. Chvátal V. The tail of the hypergeometric distribution. Discrete Math. 25:1979;285-287.
10. Coudert O. Two-level logic minimization. an overview Integration. 17:1994;97-140.
11. O. Coudert, Solving graph optimization problems with ZBDDs; Proceedings of the European Design & Test Conference, 1997.
12. R. Drechsler, A. Sarabi, M. Theobald, B. Becker, M.A. Perkowski, Efficient representation and manipulation of switching functions based on ordered Kronecker functional decision diagrams, Proceedings of the 31st Design Automation Conference, 1994, 415-419.
13. R. Drechsler, M. Theobald, B. Becker, Fast OFDD based minimization of fixed polarity Reed-Muller expressions, Proceedings of the European Design Automation Conference, 1994, (pp. 2-7).
14. Dubhashi D., Ranjan D. Balls and bins. a study in negative dependence Rand. Struct. Algor. 13(2):1998;99-124.
15. C. Gröpl, Binary decision diagrams for random boolean functions; Dissertation, Humboldt Universität zu Berlin, available via http://edoc.hu-berlin.de , 1999, 126 p.
16. Gröpl C., Srivastav A., Prömel H.J. On the evolution of the worst-case OBDD Size. Inform. Process. Lett. 77:2001;1-7.
17. Heap M.A., Mercer M.R. Least upper bounds on OBDD sizes. IEEE Trans. Comput. 43(6):1994;764-767.
18. Kamath A., Motwani R., Palem K.V., Spirakis P.G. Tail bounds for occupancy and the satisfiability threshold conjecture. Rand. Struct. Algor. 7(1):1995;59-80.
19. U. Kebschull, E. Schubert, W. Rosenstiel, Multilevel logic synthesis based on functional decision diagrams, Proceedings of the European Design Automation Conference, 1992, pp. 43-47.
20. Kolchin V.F., Sevast'iânov B.A., Chistiâkov V.P. Random Allocations. 1978;Wiley, New York.
21. Liaw H.T., Lin Chen-Shang On the OBDD-representation of general boolean functions. IEEE Trans. Comput. 41(6):1992;661-664.
22. S.I. Minato, Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems, Proc. 30th Design Automation Conference, 1993, pp. 272-277.
23. S.I. Minato, Binary Decision diagrams and Applications for VLSI CAD, Kluwer Academic Publishers, Boston, 1996, 141 p.
24. C. Meinel, T. Theobald, Algorithms and Data Struktures in VLSI-Design, Springer, Berlin, 1998, 267 p.
25. Schröer O., Wegener I. The theory of zero-suppressed BDDs and the number of Knight's tours. Formal Meth. Syst. Design. 13:1998;235-253.
26. Sieling D. The nonapproximability of OBDD minimization. Inform. and Comput. 172(2):2002;103-138.
27. F. Somenzi, CUDD, Colorado University Decision Diagram Package, available via http://vlsi.colorado.edu/~fabio/CUDD/ , 2001.
28. C.-C. Tsai, M. Marek-Sadowska, Boolean matching using generalized Reed-Muller forms; Proceedings of the 31st Design Automation Conference, 1994, pp. 339-344.
29. Wegener I. The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions. IEEE Trans. Comput. 43(11):1994;1262-1269.