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}
}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.
Topics from this paper
Paper Mentions
114 Citations
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 Lower Bound for Fourier Transform Computation in a Linear Model Over 2x2 Unitary Gates Using Matrix Entropy
- Mathematics, Computer Science
- Chic. J. Theor. Comput. Sci.
- 2013
- 9
- PDF
Lower bounds on the bounded coefficient complexity of bilinear maps
- Mathematics, Computer Science
- JACM
- 2004
- 9
- PDF
A note on the use of determinant for proving lower bounds on the size of linear circuits
- Mathematics, Computer Science
- Inf. Process. Lett.
- 1998
- 24
- Highly Influenced
An n\log n Lower Bound for Fourier Transform Computation in the Well Conditioned Model
- Computer Science, Mathematics
- ArXiv
- 2014
- 4
- PDF
A SPECTRAL APPROACH TO LOWER BOUNDS WITH APPLICATIONS TO GEOMETRIC SEARCHING
- 1998
- Highly Influenced
- PDF
An Omega((n log n)/R) Lower Bound for Fourier Transform Computation in the R-Well Conditioned Model
- Mathematics, Computer Science
- TOCT
- 2016
- 4
A spectral approach to lower bounds
- Mathematics, Computer Science
- Proceedings 35th Annual Symposium on Foundations of Computer Science
- 1994
- 16
- PDF