Fast Fourier Transform Intro | Part 0
Smart Contract Programmer · 5:09
This video is a series opener: FFT (and its modular-arithmetic twin, NTT) evaluates a degree-\(<n\) polynomial at the \(n\)th roots of unity in \(O(n\log n)\) instead of the naive \(O(n^2)\), and inverse FFT does the...