The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?

Name: The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?
Uploaded: 2020-11-14T00:00:00.000Z
Duration: 28 min 23 s
Description: The Fast Fourier Transform makes polynomial multiplication fast by converting between coefficient and value representations using evaluation at the n-th roots of unity in O(n log n) instead of O(n²).

Reducible · 28:23 · Watch on YouTube

The Fast Fourier Transform makes polynomial multiplication fast by converting between coefficient and value representations using evaluation at the n-th roots of unity in O(n log n) instead of O(n²).

Read the full summary on retube

한국어