A Lower Bound for Integer Multiplication with Read-Once Branching Programs

Authors:
Stephen Ponzio
Affiliations:
-
Venue:
SIAM Journal on Computing
Year:
1999

Citing 0
Cited 14

A read-once branching program lower bound of Ω(2n/4) for integer multiplication using universal hashing

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Almost k-wise independence and hard Boolean functions

Theoretical Computer Science - Latin American theoretical informatics
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
BDDs: design, analysis, complexity, and applications

Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
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
A note on the size of OBDDs for the graph of integer multiplication

Information Processing Letters
BDDs-design, analysis, complexity, and applications

Discrete Applied Mathematics
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
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
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that read-once branching programs computing integer multiplication require size $2^{\Omega(\sqrt{n})}$. This is the first nontrivial lower bound for multiplication on branching programs that are not oblivious. By the appropriate problem reductions, we obtain the same lower bound for other arithmetic functions.