News for hackers. Stuff that matters.
Re:How to multiply polynomials in Θ(n log n) time by leni536 on Tuesday September 08, 2015 @04:43AM (#10184622)
> This is the operation called discrete convolution, and it’s the equivalent of multiplying two polynomials in coefficient form.

As a physicist my first thought would be that convolution is simply multiplying in Fourier-space anyway, no need to think about polynomials. I didn't know the application of FFT for polynomials though so thanks for that.

There are no comments on this comment yet.