Sign inSign in

Karatsuba algorithm

A fast multiplication algorithm that reduces the number of recursive multiplication operations from 4 to 3.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Divide and conquer algorithm1Divide and conquer recurrence relations1High precision multiplication1Recursive algorithms1

Lecturers

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    A divide-and-conquer multiplication algorithm that reduces the number of multiplications to three, achieving θ(Nlog⁡23)\theta(N^{\log_2 3}) time.
    • 11:51Complexity of Basic Arithmetic

Connections

4

The lectures that define it or assume it, and the concepts next to it.

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.