# Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform

```@article{Morgenstern1973NoteOA,
title={Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform},
author={J. Morgenstern},
journal={J. ACM},
year={1973},
volume={20},
pages={305-306}
}```
• J. Morgenstern
• Published 1973
• Mathematics, Computer Science
• J. ACM
• A lower bound for the number of additions necessary to compute a family of linear functions by a linear algorithm is given when an upper bound <italic>c</italic> can be assigned to the modulus of the complex numbers involved in the computation. In the case of the fast Fourier transform, the lower bound is (<italic>n</italic>/2) log<subscrpt>2</subscrpt><italic>n</italic> when <italic>c</italic> = 1.
114 Citations

#### Paper Mentions

Lower bounds on the bounded coefficient complexity of bilinear maps
• Mathematics, Computer Science
• The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
• 2002
• 11
A note on the use of determinant for proving lower bounds on the size of linear circuits
• P. Pudlák
• Mathematics, Computer Science
• Inf. Process. Lett.
• 1998
• 24
• Highly Influenced
A spectral approach to lower bounds
• B. Chazelle
• Mathematics, Computer Science
• Proceedings 35th Annual Symposium on Foundations of Computer Science
• 1994
• 16
• PDF