Karatsuba algorithm
Algorithm for integer multiplication
The Karatsuba algorithm is a fast multiplication algorithm for integers. It was discovered by Anatoly Karatsuba in 1960 and published in 1962.
Nº Q629940 ★★★
Rare · Knowledge
Karatsuba algorithm
Algorithm for integer multiplication
The Karatsuba algorithm is a fast multiplication algorithm for integers. It was discovered by Anatoly Karatsuba in 1960 and published in 1962.
From Wikipedia
The Karatsuba algorithm is a fast multiplication algorithm for integers. It was discovered by Anatoly Karatsuba in 1960 and published in 1962. It is a divide-and-conquer algorithm that reduces the multiplication of two n-digit numbers to three multiplications of n/2-digit numbers and, by repeating this reduction, to at most n log 2 3 ≈ n 1.58 {\displaystyle n^{\log _{2}3}\approx n^{1.58}} single-digit multiplications. It is therefore asymptotically faster than the traditional algorithm, which performs n 2 {\displaystyle n^{2}} single-digit products. The Karatsuba algorithm was the first multiplication algorithm asymptotically faster than the quadratic "grade school" algorithm. The Toom–Cook algorithm (1963) is a faster generalization of Karatsuba's method, and the Schönhage–Strassen algorithm (1971) is even faster, for sufficiently large n.
Text: Wikipédia, CC BY-SA 4.0. · Image: Cmglee (CC BY-SA 4.0) ·
Related cards
-
Schönhage–Strassen algorithm
Multiplication algorithm
Nº Q1938391 ★
Not listed
-
Trachtenberg system
System of rapid mental calculation
Nº Q71746 ★★★
Not listed
-
B
Booth's multiplication algorithm
Algorithm invented by Andrew D. Booth
Nº Q477049 ★
Not listed
-
C
Coppersmith–Winograd algorithm
Algorithm for matrix multiplication
Nº Q2835794 ★
Not listed
-
C
Chudnovsky algorithm
Fast method for calculating the digits of π
Nº Q2208385 ★★
Not listed
-
Cubic formula
Cubic equation formula
Nº Q1095119 ★★★
Not listed