The Linear Complexity of Computation
- 1 April 1975
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 22 (2) , 184-194
- https://doi.org/10.1145/321879.321881
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Note on a Lower Bound on the Linear Complexity of the Fast Fourier TransformJournal of the ACM, 1973
- ON LINEAR ALGORITHMSPublished by Elsevier ,1971
- On the number of multiplications necessary to compute certain functionsCommunications on Pure and Applied Mathematics, 1970
- Discrete Fourier transforms when the number of data samples is primeProceedings of the IEEE, 1968
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965