Structured FFT and TFT: symmetric and lattice polynomials

DOI10.1145/2465506.2465526MaRDI QIDQ2963258zbMATH OpenOpenAlexFDO

Authors Joris van der Hoeven, Romain Lebreton, Éric Schost

Publication date 10 February 2017

Published in Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2465506.2465526

zbMATH Keywords

TFTlattice FFTsymmetric FFT

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• The truncated fourier transform and applications
• Regular estimates for the complexity of polynomial multiplication and truncated Fourier transform
• A new truncated Fourier transform algorithm
• An in-place truncated Fourier transform and applications to polynomial multiplication
• A method for fast computation of the Fourier transform over a finite field

Cited in

(2)

• Regular estimates for the complexity of polynomial multiplication and truncated Fourier transform
• Polynomial modular product verification and its implications

This page was built for publication: Structured FFT and TFT: symmetric and lattice polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963258)