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

    Topics from this paper

    Lower bounds on the bounded coefficient complexity of bilinear maps
    • P. Bürgisser, M. Lotz
    • 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
    • Nir Ailon
    • Mathematics, Computer Science
    • Chic. J. Theor. Comput. Sci.
    • 2013
    • 9
    • PDF
    Lower bounds on the bounded coefficient complexity of bilinear maps
    • 9
    • PDF
    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
    Optimal Complexity Lower Bound for Polynomial Multiplication
    • Highly Influenced
    • PDF
    An n\log n Lower Bound for Fourier Transform Computation in the Well Conditioned Model
    • Nir Ailon
    • Computer Science, Mathematics
    • ArXiv
    • 2014
    • 4
    • PDF
    A SPECTRAL APPROACH TO LOWER BOUNDS WITH APPLICATIONS TO GEOMETRIC SEARCHING
    • Highly Influenced
    • PDF
    A spectral approach to lower bounds
    • B. Chazelle
    • Mathematics, Computer Science
    • Proceedings 35th Annual Symposium on Foundations of Computer Science
    • 1994
    • 16
    • PDF