Affiliation:
1. Mathématiques et Sciences Théoriques, Université de Nice, Nice, France
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) log
2
n
when
c
= 1.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference4 articles.
1. Algorithmes lindaires;MORGENSTERN J;Compt. Rend. Acad. Sci.
2. QVEYSANNE M. Ag~bre M.G.P. Collection U. Armand Colin Paris 1966 Exercice No. 258 p. 363. QVEYSANNE M. Ag~bre M.G.P. Collection U. Armand Colin Paris 1966 Exercice No. 258 p. 363.
3. An algorithm for the machine computation of complex Fourier series;COOLEY J. W;Math. Comp.,1964
Cited by
79 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献