BDDs - Design, analysis, complexity, and applications

Discrete Applied Mathematics

Volumn 138, Issue 1-2, 2004, Pages 229-251

  Wegener, Ingo ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING;

BINARY DECISION DIAGRAMS (BDD); BRANCHING PROGRAMS (BP);

DATA STRUCTURES;

EID: 1242287441     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00297-X     Document Type: Conference Paper

References (41)

1. M. Ajtai, A non-linear time bound for boolean branching programs, FOCS'99, IEEE Computer Society Press, Los Alamitos, Calif., 1999, pp. 60-70.
2. Atkins D.F. Higher-radix division using estimates of divisor and remainder. IEEE Trans. Comput. 17:1968;925-934.
3. Beame P., Jayram T.S., Saks M. Time-space tradeoffs for branching programs. Journal of Computer and System Sciences. 63:2001;542-572.
4. P. Beame, M. Saks, X. Sun, E. Vee, Super-linear time-space tradeoff lower bounds for randomized computation, FOCS'2000, IEEE Computer Society Press, Los Alamitos, Calif., 2000, pp. 169-179.
5. Bollig B., Löbbing M., Wegener I. On the effect of local changes in the variable ordering of ordered decision diagrams. Inform. Process. Lett. 59:1996;233-239.
6. Bollig B., Sauerhoff M., Sieling D., Wegener I. Hierarchy theorems for. k -OBDDs and k -IBDDs Theoret. Comput. Sci. 205:1998;45-60.
7. Bollig B., Wegener I. Improving the variable ordering of OBDDs is. NP -complete IEEE Trans. Comput. 45:1996;993-1002.
8. Bollig B., Wegener I. Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams. Theory Comput. Systems. 32:1999;487-503.
9. B. Bollig, I. Wegener, Asymptotically optimal lower bounds for OBDDs and the solution of some basic OBDD problems, ICALP'2000, Lecture Notes in Computer Science, Vol. 1853, Springer, Berlin, 2000, pp. 187-198.
10. n/4) for integer multiplication using universal hashing, STOC'2001, ACM, New York, 2001, pp. 419-424.
11. Borodin A., Razborov A., Smolensky P. On lower bounds for read-. k -times branching programs Comput. Complexity. 3:1993;1-18.
12. Bryant R.E. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35:1986;677-691.
13. Bryant R.E. On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. IEEE Trans. Comput. 40:1991;205-213.
14. Bryant R.E. Bit-level analysis of an SRT divider, ACM and IEEE Computer Society. Design Automat. Conf. 33:1996;661-665.
15. A. Cobham, The recognition problem for the set of perfect squares, Seventh IEEE Symposium on Switching and Automata Theory, IEEE Computer Society Press, Los Alamitos, Calif., 1966, pp. 78-87.
16. R. Drechsler, N. Göckel, Minimization of BDDs by evolutionary algorithms, IWLS'97, International Workshop on Logic Synthesis, 1997, Workshop handouts.
17. J. Feigenbaum, S. Kannan, M.Y. Vardi, M. Viswanathan, Complexity of graphs represented as OBDDs, STACS'98, Lecture Notes in Computer Science, Vol. 1373, Springer, Berlin, 1998, pp. 216-226.
18. Gergov J. Time-space tradeoffs for integer multiplication on various types of input oblivious sequential machines. Inform. Process. Lett. 51:1994;265-269.
19. Gergov J., Meinel C. Efficient Boolean manipulation with OBDD's can be extended to FBDD's. IEEE Trans. Comput. 43:1994;1197-1209.
20. Hachtel G.D., Somenzi F. A symbolic algorithm for maximum flow in 0-1 networks. Formal Methods System Design. 10:1997;207-219.
21. Hromkovič J. Communication Complexity and Parallel Computing. 1997;Springer, Berlin.
22. Jain J., Mohanram K., Moundanos D., Wegener I., Lu Y. Analysis of composition, and how to obtain smaller canonical graphs, ACM, New York. Design Automat. Conf. 37:2000;681-686.
23. Kushilevitz E., Nisan N. Communication Complexity. 1997;Cambridge University Press, Cambridge.
24. Lee C.Y. Representation of switching circuits by binary-decision programs. Bell Systems Technical J. 38:1959;985-999.
25. 3) algorithm for finding maximum flows in networks Inform. Process. Lett. 7:1978;277-278.
26. A. Narayan, J. Jain, M. Fujita, A. Sangiovanni-Vincentelli, Partitioned ROBDDs - a compact, canonical and efficiently manipulable representation for Boolean functions, ICCAD'96, ACM and IEEE Computer Society, 1996, pp. 547-554.
27. Nechiporuk E.I. A Boolean function. Sov. Math. Dokl. 7:1996;999-1000.
28. Okol'nishikova E.A. On lower bounds for branching programs. Siberian Adv. Math. 3:1993;157-166.
29. Ponzio S. A lower bound for integer multiplication with read-once branching programs. SIAM J. Comput. 28:1998;798-815.
30. R. Rudell, Dynamic variable ordering for ordered binary decision diagrams, ICCAD'93, ACM and IEEE Computer Society, 1993, pp. 42-47.
31. Sauerhoff M., Wegener I., Werchner R. Optimal ordered binary decision diagrams for read-once formulas. Discrete Appl. Math. 103:2000;237-258.
32. D. Sieling, On the existence of polynomial time approximation schemes for OBDD minimization, STACS'98, Lecture Notes in Computer Science, Vol. 1373, Springer, Berlin, 1998, pp. 205-215.
33. Sieling D., Wegener I. Reduction of OBDDs in linear time. Inform. Process. Lett. 48:1993;139-144.
34. Sieling D., Wegener I. Graph driven BDDs - a new data structure for Boolean functions. Theoret. Comput. Sci. 141:1995;283-310.
35. Simon J., Szegedy M. A new lower bound theorem for read-only-once branching programs and its applications. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 13:1993;183-193.
36. Somenzi F. CUDD. CU decision diagram package release 2.3.0. 1998;University of Colorado, Boulder, CO.
37. Wegener I. On the complexity of branching programs and decision trees for clique functions. J. ACM. 35:1998;461-471.
38. Wegener I. Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions. Inform. Process. Lett. 46:1993;85-87.
39. I. Wegener, Branching Programs and Binary Decision Diagrams - Theory and Applications, SIAM Monographs on Discrete Mathematics and Applications, 2000.
40. P. Woelfel, New bounds on the OBDD size of integer multiplication via universal hashing, 18, STACS, Lecture Notes in Computer Science, Vol. 2010, Springer, Berlin, 2001, pp. 563-574.
41. S. Žák, An exponential lower bound for one-time-only branching programs, MFCS'84, Lecture Notes in Computer Science, Vol. 176, Springer, Berlin, 1984, pp. 562-566.