FFT and Convulutions
This is the 1st class in the micro course "FFT in Polynomial operations and Advanced Combinatorics". In this class we are going to be looking at what is FFT or Fast Fourier Transform, and how is it used to solve the problem of efficient polynomial multiplication and convulutions. Specifically we are also going to be looking at a variant of FFT called NTT or Number Theoretic Transform, and seeing how do we come from FFT to NTT.
Jan 11, 2021 • 2h 0m