Structured FFT and TFT
Joris van der Hoeven, Romain Lebreton, Éric Schost · 2013
In this paper, we consider the problem of efficient computations with structured polynomials. We provide complexity results for computing Fourier Transform and Truncated Fourier Transform of symmetric polynomials, and for multiplying polynomials supported on a lattice.