Structured FFT and TFT: symmetric and lattice polynomials

Joris van der Hoeven (1) , Romain Lebreton (2) , Eric Schost (3)

1 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
2 ECO - Exact Computing
3 Computer Science Department

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.

Mots clés: complexity; TFT; symmetric polynomial; FFT

Domaines: Logiciel mathématique [cs.MS]

Joris van der Hoeven, Romain Lebreton, Eric Schost. Structured FFT and TFT: symmetric and lattice polynomials. ISSAC 2013 - 38th International Symposium on Symbolic and Algebraic Computation, Jun 2013, Boston, United States. pp.355-362, ⟨10.1145/2465506.2465526⟩. ⟨hal-00780431⟩