Hacker News Reader

They also separately give algorithm for Fourier transform over complex number faster than O(n log n)

Wikipedia just told me there's a galactic algorithm for integer multiplication in O(n log n) based on FFT so I'm guessing those two proofs are related.

Multiplication is a lot like convolution, so the connection is natural.

multiplication is implemented w the fft

Reply on news.ycombinator.com