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

DOI10.1137/S0097539795290349zbMATH Open0918.68025OpenAlexW2072440393MaRDI QIDQ4229407FDOQ4229407

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

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

zbMATH Keywords

verificationmultiplicationBDDbranching programsread-once

Mathematics Subject Classification ID

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

Cited In (17)

• Title not available (Why is that?)
• On the OBDD Complexity of the Most Significant Bit of Integer Multiplication
• New results on the most significant bit of integer multiplication
• Almost \(k\)-wise independence and hard Boolean functions.
• Streaming and query once space complexity of longest increasing subsequence
• A note on the size of OBDDs for the graph of integer multiplication
• 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.
• New results on the complexity of the middle bit of multiplication
• Better upper bounds on the QOBDD size of integer 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
• Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
• Randomized OBDDs for the most significant bit of multiplication need exponential size
• Lower Bounds for Multiplication via Network Coding
• On the OBDD complexity of the most significant bit of integer multiplication
• BDDs -- design, analysis, complexity, and applications.

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)