New Results on the Most Significant Bit of Integer Multiplication

DOI10.1007/978-3-540-92182-0_77zbMath1183.68303OpenAlexW1848130230MaRDI QIDQ3597887

Jochen Klump, Beate Bollig

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_77

Mathematics Subject Classification ID

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

Related Items (3)

On the OBDD complexity of the most significant bit of integer multiplication ⋮ Larger lower bounds on the OBDD complexity of integer multiplication ⋮ Larger Lower Bounds on the OBDD Complexity of Integer Multiplication

This page was built for publication: New Results on the Most Significant Bit of Integer Multiplication