Asymptotically fast multiplication algorithm for big integers. Understanding this algorithm and its implementations.
Karatsuba algorithm requires O(nlog₂3) single digit multiplication operations to multiply a pair of n-digit numbers and is therefore asymptotically faster than the common O(n²) multiplication algorithm.
It was proposed by Anatoly Karatsuba in a paper published in the Proceedings of the USSR Academy of Science in 1962.
A related tag is strassen that covers both Schönhage–Strassen multiplication algorithm and Strassen matrix multiplication algorithm.
Useful links
- Karatsuba algorithm on Wikipedia
- The Complexity of Computations by A.A. Karatsuba (published in 1995)
- Draft of Multiplication of Long Integers chapter by Arno Eigenwillig and Kurt Mehlhorn from Algorithms Unplugged
