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

Authors:
Jacques Morgenstern
Affiliations:
Mathématiques et Sciences Théoriques, Université de Nice, Nice, France
Venue:
Journal of the ACM (JACM)
Year:
1973

Citing 0
Cited 15

On the complexity of bilinear forms: dedicated to the memory of Jacques Morgenstern

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Lower bounds for off-line range searching

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The Linear Complexity of Computation

Journal of the ACM (JACM)
Optimality of the Fast Fourier transform

Journal of the ACM (JACM)
On the complexity of matrix product

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
T-Efficient Calculation of the ε-Solutions to Problems of Calculus and Applied Mathematics. I

Cybernetics and Systems Analysis
Lower bounds on the bounded coefficient complexity of bilinear maps

Journal of the ACM (JACM)
Faster integer multiplication

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Note: A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle

Theoretical Computer Science
Complexity Lower Bounds using Linear Algebra

Foundations and Trends® in Theoretical Computer Science
Faster dimension reduction

Communications of the ACM
Fast modular transforms

Journal of Computer and System Sciences
Arithmetic Circuits: A survey of recent results and open questions

Foundations and Trends® in Theoretical Computer Science
Min-rank conjecture for log-depth circuits

Journal of Computer and System Sciences
Cancellation-Free circuits in unbounded and bounded depth

FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.03

Visualization

Abstract

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 c 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 (n/2) log2n when c = 1.