Lecture 3 - Divide and conquer: Fast fourier transform. The following will be discussed in this chapter: Polynomial operations vs. representations; divide and conquer algorithm; collapsing samples / roots of unity; FFT, IFFT, and polynomial multiplication. | Lecture Design and Analysis of Algorithms - Lecture 3: Divide and conquer: Fast fourier transform