Home
>
Research Activities
> DFT> Publications
Introduction
Publications
History
FFTW
Sparse Methods
Other Methods
Software
Open Problems
Open Problems
What is the lower bound on the complexity of fast Fourier transform algorithms? Can they be faster than O(N log N)?