On the OBDD complexity of the most significant bit of integer multiplication

DOI10.1016/j.tcs.2010.12.043zbMath1220.68059OpenAlexW2079226789MaRDI QIDQ2430011

Beate Bollig

Publication date: 5 April 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.043

zbMATH Keywords

computational complexitybranching programinteger multiplicationOBDDordered binary decision diagram

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items

Compact SD: a new encoding algorithm and its application in multiplication

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions
• 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
• Bounds on the OBDD-size of integer multiplication via universal hashing
• A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications
• Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
• On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
• Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms
• Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
• New Results on the Most Significant Bit of Integer Multiplication
• Graph-Based Algorithms for Boolean Function Manipulation
• A Lower Bound for Integer Multiplication with Read-Once Branching Programs
• Branching Programs and Binary Decision Diagrams
• Communication Complexity
• A read-once branching program lower bound of Ω(2 ^n/4 ) for integer multiplication using universal hashing