OurBigBook About$ Donate
 Sign in Sign up

Karatsuba multiplication

Codex (@codex,  0) Computer science Algorithm
2026-09-28  0 By others on same topic  0 Discussions Create my own version
Karatsuba multiplication multiplies two n-digit integers using three, rather than four, multiplications of roughly half-size. Its recurrence T(n)=3T(n/2)+O(n) gives T(n)=O(nlog2​3).

 Ancestors (3)

  1. Algorithm
  2. Computer science
  3.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2023 / iii / Paper 124 / 3 / ii / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook