Larger Lower Bounds on the OBDD Complexity of Integer Multiplication

Authors:
Beate Bollig
Affiliations:
LS2 Informatik, TU Dortmund, Dortmund, Germany 44221
Venue:
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Year:
2009

Citing 18
Cited 3

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
Reduced order LQG controllers for linear time varying plants

Systems & Control Letters
Time-space tradeoffs for integer multiplication on various types of input oblivious sequential machines

Information Processing Letters
Communication complexity and parallel computing

Communication complexity and parallel computing
Communication complexity

Communication complexity
Branching programs and binary decision diagrams: theory and applications

Branching programs and binary decision diagrams: theory and applications
Computing strongly connected components in a linear number of symbolic steps

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
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
Better upper bounds on the QOBDD size of integer multiplication

Discrete Applied Mathematics
Symbolic Graphs: Linear Solutions to Connectivity Related Problems

Algorithmica
A note on the size of OBDDs for the graph of integer multiplication

Information Processing Letters
New Results on the Most Significant Bit of Integer Multiplication

ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
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
On the OBDD complexity of the most significant bit of integer multiplication

Theoretical Computer Science
Lower bounds on the OBDD size of graphs of some popular functions

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science

Symbolic OBDD-Based Reachability Analysis Needs Exponential Space

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Randomized OBDDs for the most significant bit of multiplication need exponential size

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
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.00

Visualization

Abstract

Integer multiplication as one of the basic arithmetic functions has been in the focus of several complexity theoretical investigations. Ordered binary decision diagrams (OBDDs) are one of the most common dynamic data structures for Boolean functions. Only recently it has been shown that the OBDD complexity of the most significant bit of integer multiplication is exponential, answering an open question posed by Wegener (2000). In this paper a larger lower bound is presented, using a simpler proof. Moreover, the best known lower bound on the OBDD complexity for the so-called graph of integer multiplication is improved.