Metraipolis › archive › dc_02e6adda0645

Karatsuba algorithm — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Karatsuba_algorithm
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-06T14:06:37.149Z
SHA-256 of the archived text
1c325807542ec2ce137be0355c42001c4a5577af0887f159039ad5360a1d1d1e
Stable URL of this page
https://metraipolis.com/documento/dc_02e6adda0645

How to cite

Karatsuba algorithm — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Karatsuba_algorithm (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_02e6adda0645 (Metraipolis archive dc_02e6adda0645, sha256 1c325807542ec2ce137be0355c42001c4a5577af0887f159039ad5360a1d1d1e)
BibTeX
@misc{dc02e6adda0645,
  title = {Karatsuba algorithm — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Karatsuba_algorithm},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_02e6adda0645; sha256 1c325807542ec2ce137be0355c42001c4a5577af0887f159039ad5360a1d1d1e},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Karatsuba_algorithm. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; ricerca «algorithm»).
Fonte: Wikipedia in inglese, voce «Karatsuba algorithm» — https://en.wikipedia.org/wiki/Karatsuba_algorithm
Wikidata Q629940: «algoritmo di moltiplicazione rapida per moltiplicare grandi numeri interi o polinomi» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q629940
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Karatsuba_algorithm?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1374658838, consultata il 2026-10-06T12:26:06.742Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 4929fe8e5ce38622b216aa78750330da28b095a8346447c37ad31667d7273ed4