Optimality of the Fast Fourier transform

DOI10.1145/322108.322118MaRDI QIDQ4170248zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Christos Papadimitriou

Publication date 1979

Published in Journal of the ACM (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(6)

• Fast Fourier optimization
• The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform
• Paraunitary matrices, entropy, algebraic condition number and Fourier computation
• An \(\mathrm{Omega}((n \log n)/R)\) lower bound for Fourier transform computation in the \(R\)-well conditioned model
• Tighter Fourier transform lower bounds
• Faster Walsh-Hadamard and discrete Fourier transforms from matrix non-rigidity

This page was built for publication: Optimality of the Fast Fourier transform

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