A Lower Bound for Integer Multiplication with Read-Once Branching Programs
From MaRDI portal
Publication:4229407
DOI10.1137/S0097539795290349zbMath0918.68025OpenAlexW2072440393MaRDI QIDQ4229407
Publication date: 22 February 1999
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539795290349
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (11)
Better upper bounds on the QOBDD size of integer multiplication ⋮ On the OBDD Complexity of the Most Significant Bit of Integer Multiplication ⋮ Almost \(k\)-wise independence and hard Boolean functions. ⋮ New results on the most significant bit of integer multiplication ⋮ On the OBDD complexity of the most significant bit of integer multiplication ⋮ BDDs -- design, analysis, complexity, and applications. ⋮ Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication ⋮ A note on the size of OBDDs for the graph of integer multiplication ⋮ Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication ⋮ Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size ⋮ Lower Bounds for Multiplication via Network Coding
This page was built for publication: A Lower Bound for Integer Multiplication with Read-Once Branching Programs
