Multiplication is the easiest nontrivial arithmetic function

DOI10.1016/0304-3975(85)90051-9zbMath0578.68034OpenAlexW2003165068MaRDI QIDQ1066671

Helmut Alt

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90051-9

zbMATH Keywords

Boolean operationsinteger multiplicationBoolean circuitfixed point multiplication

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (3)

Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. ⋮ A refined model of computation for continuous problems ⋮ Multiplication is the easiest nontrivial arithmetic function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiplication is the easiest nontrivial arithmetic function
• Numerics of analytic functions and complexity
• On the computational power of pushdown automata
• Fast multiplication of large numbers
• Fast Multiple-Precision Evaluation of Elementary Functions
• On Relating Time and Space to Size and Depth

This page was built for publication: Multiplication is the easiest nontrivial arithmetic function