A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication

DOI10.1007/978-3-642-12200-2_24zbMath1283.68132OpenAlexW155275764MaRDI QIDQ3557025

Beate Bollig

Publication date: 27 April 2010

Published in: LATIN 2010: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12200-2_24

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Related Items (3)

Randomized OBDDs for the most significant bit of multiplication need exponential space ⋮ An asymptotically optimal lower bound on the OBDD size of the middle bit of multiplication for the pairwise ascending variable order ⋮ Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size

This page was built for publication: A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication