New Results on the Most Significant Bit of Integer Multiplication

DOI10.1007/978-3-540-92182-0_77MaRDI QIDQ3597887zbMATH OpenOpenAlexFDO

Authors Beate Bollig, Jochen Klump

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

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

Recommendations

• New results on the most significant bit of integer multiplication
• New results on the complexity of the middle bit of multiplication
• On the OBDD complexity of the most significant bit of integer multiplication
• New methods for binary multiplication
• On the OBDD Complexity of the Most Significant Bit of Integer Multiplication
• A larger lower bound on the OBDD complexity of the most significant bit of multiplication
• Protecting the most significant bits in scalar multiplication algorithms
• Better upper bounds on the QOBDD size of integer multiplication
• New iterative algorithms for modular multiplication
• A new algorithm for multiplication in finite fields

Cited in

(8)

• New results on the most significant bit of integer multiplication
• On the OBDD complexity of the most significant bit of integer multiplication
• Integer multiplication and the complexity of binary decision diagrams
• A larger lower bound on the OBDD complexity of the most significant bit of multiplication
• Larger Lower Bounds on the OBDD Complexity of Integer Multiplication
• New results in binary multiple descriptions
• Larger lower bounds on the OBDD complexity of integer multiplication
• A note on the size of OBDDs for the graph of integer multiplication

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

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