Sign inSign in

Schönhage-Strassen algorithm

An asymptotically fast multiplication algorithm for large integers running in O(n log n log log n) time.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 3 definitions
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    • 27:5810^500 Parallel Universes
  • Srini Devadas

    MIT · Undergraduate

    An asymptotically fast multiplication algorithm using the fast Fourier transform that runs in θ(n log n log log n) time.
    • 17:34Square Roots, Newton's Method

Connections

7

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.