- The
Karatsuba algorithm is a fast
multiplication algorithm. It was
discovered by
Anatoly Karatsuba in 1960 and
published in 1962. It is a divide-and-conquer...
-
Anatoly Alexeyevich Karatsuba (his
first name
often spelled Anatolii) (Russian: Анато́лий Алексе́евич Карацу́ба; Grozny,
Soviet Union, 31
January 1937...
-
primes containing an
arithmetic progression,
Karatsuba proved that this
limit is infinite. We
restate the
Karatsuba phenomenon using mathematical terminology...
- N.J.(1956).
Karatsuba A. A.
Solution of one
problem from the
theory of
finite automata. Usp. Mat. Nauk, 15:3, 157–159 (1960).
Karatsuba A. A. Experimente...
-
sorting (e.g., quicksort,
merge sort),
multiplying large numbers (e.g., the
Karatsuba algorithm),
finding the
closest pair of points,
syntactic analysis (e...
- {\displaystyle O(n^{2})} , but in 1960
Anatoly Karatsuba discovered that
better complexity was
possible (with the
Karatsuba algorithm). Currently, the algorithm...
- conjecture. The
estimates of
Selberg and
Karatsuba can not be
improved in
respect of the
order of
growth as T → ∞.
Karatsuba (1992)
proved that an
analog of the...
- E. A.
Karatsuba: Fast com****tion of the
Riemann zeta
function for
integer argument. Dokl. Math. Vol.54, No.1, p. 626 (1996). E. A.
Karatsuba: Fast evaluation...
- but with
sometimes superior real-world
performance for
smaller N. The
Karatsuba multiplication is such an algorithm. For division, see
division algorithm...
- of the computer's time is
devoted to multiplication. They
include the
Karatsuba algorithm, Toom–Cook multiplication, and
Fourier transform-based methods...
