Randomized OBDDs for the most significant bit of multiplication need exponential space

Authors:
Beate Bollig;Marc Gillé
Affiliations:
LS2 Informatik, TU Dortmund, 44221 Dortmund, Germany;LS2 Informatik, TU Dortmund, 44221 Dortmund, Germany
Venue:
Information Processing Letters
Year:
2011

Citing 13
Cited 0

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication

IEEE Transactions on Computers
On data structures and asymmetric communication complexity

Journal of Computer and System Sciences
Branching programs and binary decision diagrams: theory and applications

Branching programs and binary decision diagrams: theory and applications
On the Power of Randomized Branching Programs

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Lower Bounds for Randomized Read-k-Times Branching Programs (Extended Abstract)

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A lower bound for integer multiplication on randomized ordered read-once branching programs

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

Journal of Computer and System Sciences
Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication

Theoretical Computer Science
On the OBDD complexity of the most significant bit of integer multiplication

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
A larger lower bound on the OBDD complexity of the most significant bit of multiplication

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics

Quantified Score

Hi-index	0.89

Visualization

Abstract

Integer multiplication as one of the basic arithmetic functions has been in the focus of several complexity theoretical investigations and ordered binary decision diagrams (OBDDs) are one of the most common dynamic data structures for Boolean functions. Only in 2008 the question whether the deterministic OBDD complexity of the most significant bit of integer multiplication is exponential has been answered affirmatively. Since probabilistic methods have turned out to be useful in almost all areas of computer science, one may ask whether randomization can help to represent the most significant bit of integer multiplication in smaller size. Here, it is proved that the randomized OBDD complexity is also exponential.