The Fast Fourier Transform

DOI10.1137/060658242zbMath1141.65093OpenAlexW2082484042MaRDI QIDQ5453574

Ulrich Oberst

Publication date: 3 April 2008

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/060658242

zbMATH Keywords

complexityalgorithmsfast Fourier transformdiscrete Fourier transformfinite abelian groupsfast convolutionnumber theoretic transforms

Mathematics Subject Classification ID

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

Related Items (1)

Correlated pseudorandomness from the hardness of quasi-abelian decoding

This page was built for publication: The Fast Fourier Transform