ConceptTheory & Algos
Schönhage-Strassen algorithm
An asymptotically fast multiplication algorithm for large integers running in O(n log n log log n) time.
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
2Each in their own terms, from the easiest level.
Ryan O'Donnell
Srini Devadas
An asymptotically fast multiplication algorithm using the fast Fourier transform that runs in θ(n log n log log n) time.
Connections
7The lectures that define it or assume it, and the concepts next to it.