@inproceedings{0e758afdbb08434b99d156473c757053,
title = "Structured FFT and TFT: Symmetric and lattice polynomials",
abstract = "In this paper, we consider the problem of efficient computa- tions with structured polynomials. We provide complexity results for computing Fourier Transform and Truncated Fourier Transform of symmetric polynomials, and for mul- tiplying polynomials supported on a lattice.",
keywords = "Lattice FFT, Symmetric FFT, TFT",
author = "\{Van Der Hoeven\}, Joris and Romain Lebreton and {\'E}ric Schost",
year = "2013",
month = aug,
day = "23",
doi = "10.1145/2465506.2465526",
language = "English",
isbn = "9781450320597",
series = "Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC",
pages = "355--362",
booktitle = "ISSAC 2013 - Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation",
note = "38th International Symposium on Symbolic and Algebraic Computation, ISSAC 2013 ; Conference date: 26-06-2013 Through 29-06-2013",
}