On the computational complexity of the general discrete fourier transform
- 31 December 1987
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 51 (3) , 331-339
- https://doi.org/10.1016/0304-3975(87)90041-7
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Schur multipliers of the known finite simple groups. IIProceedings of Symposia in Pure Mathematics, 1981
- The complexity of group algebra computationsTheoretical Computer Science, 1977
- Fast Fourier Transforms on Finite Non-Abelian GroupsIEEE Transactions on Computers, 1977
- Note on a Lower Bound on the Linear Complexity of the Fast Fourier TransformJournal of the ACM, 1973
- Gaussian elimination is not optimalNumerische Mathematik, 1969
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965