Bounds on the OBDD-size of integer multiplication via universal hashing

Journal of Computer and System Sciences

Volumn 71, Issue 4, 2005, Pages 520-534

  Woelfel, Philipp ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Binary decision diagrams; Branching programs; Integer multiplication; OBDDs

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; DECISION MAKING; GRAPH THEORY;

BINARY DECISION DIAGRAMS (BDD); BRANCHING PROGRAMS; INTEGER MULTIPLICATION; OBDD;

VLSI CIRCUITS;

EID: 27344452338     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2005.05.004     Document Type: Article

References (18)

1. B. Bollig, and I. Wegener Improving the variable ordering of OBDDs is NP-complete IEEE Trans. Comput. 45 1996 993 1002
2. B. Bollig, I. Wegener, Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems, in: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP), 2000, pp. 187-198.
3. Y. Breitbart, H.B. Hunt III, and D.J. Rosenkrantz On the size of binary decision diagrams representing boolean functions Theoret. Comput. Sci. 145 1995 45 69
4. R.E. Bryant Graph-based algorithms for boolean function manipulation IEEE Trans. Comput. C-35 1986 677 691
5. R.E. Bryant On the complexity of VLSI implementations and graph representations of boolean functions with applications to integer multiplication IEEE Trans. Comput. 40 1991 205 213
6. J.L. Carter, and M.N. Wegman Universal classes of hash functions J. Comput. System Sci. 18 1979 143 154
7. M. Dietzfelbinger, Universal hashing and k-wise independent random variables via integer arithmetic without primes, in: Proceedings of the 13the Annual Symposium on Theoretical Aspects of Computer Science (STACS), vol. 1046, Lecture Notes in Computer Science, 1996, pp. 569-580.
8. M. Dietzfelbinger, T. Hagerup, J. Katajainen, and M. Penttonen A reliable randomized algorithm for the closest-pair problem J. Algorithms 25 1997 19 51
9. Y. Mansour, N. Nisan, and P. Tiwari The computational complexity of universal hashing Theoret. Comput. Sci. 107 1993 121 133
10. S. Ponzio, A lower bound for integer multiplication with read-once branching programs, in: Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC), 1995, pp. 130-139.
11. M. Sauerhoff, P. Woelfel, Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions, in: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), 2003, pp. 186-195.
12. D. Sieling, On the existence of polynomial time approximation schemes for OBDD minimization, in: Proceedings of the 15the Annual Symposium on Theoretical Aspects of Computer Science (STACS), 1998, pp. 205-215.
13. D. Sieling, and I. Wegener NC-algorithms for operations on binary decision diagrams Parallel Processing Lett. 48 1993 139 144
14. I. Wegener Branching Programs and Binary Decision Diagrams - Theory and Applications 2000 SIAM Philadelphia, PA
15. M.N. Wegman, J.L. Carter, New classes and applications of hash functions, in: Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1979, pp. 175-182.
16. P. Woelfel, Efficient strongly universal and optimally universal hashing, in: Mathematical Foundations of Computer Science: 24th International Symposium (MFCS), vol. 1672, Lecture Notes in Computer Science, 1999, pp. 262-272.
17. P. Woelfel, New bounds on the OBDD-size of integer multiplication via universal hashing, in: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS), vol. 2010, Lecture Notes in Computer Science, 2001, pp. 563-574.
18. B. Yang, Y.-A. Chen, R.E. Bryant, D.R. O'Hallaron, Space- and time-efficient BDD construction via working set control, in: Proceedings of the Asia South-Pacific Design Automation Conference (ASPDAC), 1998, pp. 423-432.