Fast generalized Fourier transforms
- 5 September 1989
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 67 (1) , 55-63
- https://doi.org/10.1016/0304-3975(89)90021-2
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Fast Fourier Transforms for Metabelian GroupsSIAM Journal on Computing, 1989
- On the computational complexity of the general discrete fourier transformTheoretical Computer Science, 1987
- Beth, Th., Verfahren der schnellen Fourier-Transformation. Stuttgart, B. G. Teubner 1984. 316 S., DM 34,—. ISBN 3-519-02363-6 (Leitfäden der angewandten Mathematik und Mechanik 61)ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1985
- The complexity of group algebra computationsTheoretical Computer Science, 1977
- On computing the Discrete Fourier TransformProceedings of the National Academy of Sciences, 1976
- Note on a Lower Bound on the Linear Complexity of the Fast Fourier TransformJournal of the ACM, 1973
- ENDLICHE GRUPPEN IJournal of the London Mathematical Society, 1969
- An Algorithm for the Machine Calculation of Complex Fourier SeriesMathematics of Computation, 1965
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965
- Young’s semi-normal representation of the symmetric groupDuke Mathematical Journal, 1941