Abstract
In Chap. 1 we called the basic operations of arithmetic elementary operations and assumed that they run in constant time. It is often practical to make this assumption, although it is clearly by no means a realistic one for arbitrarily large numbers. Here we will investigate how fast one can actually compute with integers. Here, in a narrower sense, elementary operations only include operations and comparisons restricted to integers in some bounded interval.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Bibliography
Fürer M. Faster integer multiplication. SIAM Journal on Computing 2009;39:979–1005.
Karatsuba A, Ofman Y. Multiplication of multidigit numbers on automata. Soviet Physics 1963;Doklady 7:595–6.
Schönhage A, Strassen V. Schnelle Multiplikation großer Zahlen. Computing 1971;7:281–92.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Hougardy, S., Vygen, J. (2016). Computing with Integers. In: Algorithmic Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-39558-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-39558-6_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-39557-9
Online ISBN: 978-3-319-39558-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)