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

DOI10.1137/S0097539795290349MaRDI QIDQ4229407zbMATH OpenOpenAlexFDO

Authors Stephen J. Ponzio

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

zbMATH Keywords

BDDbranching programsmultiplicationread-onceverification

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication
• scientific article; zbMATH DE number 1759409
• A read-once branching program lower bound of \({\omega}(2^{n/4})\) for integer multiplication using universal hashing
• A lower bound for integer multiplication on randomized ordered read-once branching programs.
• Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication

Cited in

(19)

• Almost \(k\)-wise independence and hard Boolean functions.
• A lower bound for integer multiplication on randomized ordered read-once branching programs.
• BDDs -- design, analysis, complexity, and applications.
• Better upper bounds on the QOBDD size of integer multiplication
• New results on the most significant bit of integer multiplication
• On the OBDD complexity of the most significant bit of integer multiplication
• New results on the complexity of the middle bit of multiplication
• Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication
• Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication
• Randomized OBDDs for the most significant bit of multiplication need exponential size
• On the OBDD Complexity of the Most Significant Bit of Integer Multiplication
• Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
• scientific article; zbMATH DE number 1263188 (Why is no real title available?)
• scientific article; zbMATH DE number 1759409 (Why is no real title available?)
• Lower Bounds for Multiplication via Network Coding
• A read-once branching program lower bound of \({\omega}(2^{n/4})\) for integer multiplication using universal hashing
• Streaming and query once space complexity of longest increasing subsequence
• Explicit directional affine extractors and improved hardness for linear branching programs
• A note on the size of OBDDs for the graph of integer multiplication

This page was built for publication: A Lower Bound for Integer Multiplication with Read-Once Branching Programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229407)