Integer multiplication and the complexity of binary decision diagrams

zbMATH Open1191.68347MaRDI QIDQ3397629FDOQ3397629

Authors: Beate Bollig 

Publication date: 22 September 2009

Recommendations

• On the OBDD complexity of the most significant bit of integer multiplication
• 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
• New Results on the Most Significant Bit of Integer Multiplication

zbMATH Keywords

complexityordered binary decision diagramsinteger multiplicationdynamic data structure

Mathematics Subject Classification ID

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

Cited In (7)

• On the OBDD Complexity of the Most Significant Bit of Integer Multiplication
• Larger lower bounds on the OBDD complexity of integer multiplication
• Factorization using binary decision diagrams
• When is scalar multiplication decidable?
• Randomized OBDDs for the most significant bit of multiplication need exponential space
• Randomized OBDDs for the most significant bit of multiplication need exponential size
• Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams

This page was built for publication: Integer multiplication and the complexity of binary decision diagrams

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