Is computing with the finite Fourier transform pure or applied mathematics?
- 1 January 1979
- journal article
- Published by American Mathematical Society (AMS) in Bulletin of the American Mathematical Society
- Vol. 1 (6) , 847-897
- https://doi.org/10.1090/s0273-0979-1979-14686-x
Abstract
References [Enhancements On Off] (What's this?)Keywords
This publication has 19 references indexed in Scilit:
- Algebraic Structures for Σ n 1 L 2 (Z/n) Compatible with the Finite Fourier TransformTransactions of the American Mathematical Society, 1978
- The multiplicity problem for 4-dimensional solvmanifoldsBulletin of the American Mathematical Society, 1977
- Some bilinear forms whose multiplicative complexity depends on the field of constantsTheory of Computing Systems, 1976
- Translation-invariant subspaces inL 2 of a compact nilmanifold. IInventiones Mathematicae, 1973
- Harmonic Analysis on NilmanifoldsTransactions of the American Mathematical Society, 1970
- On the number of multiplications necessary to compute certain functionsCommunications on Pure and Applied Mathematics, 1970
- An Algorithm for the Machine Calculation of Complex Fourier SeriesMathematics of Computation, 1965
- A Brief Introduction to Theta Functions.The American Mathematical Monthly, 1964
- Sur certains groupes d'opérateurs unitairesActa Mathematica, 1964
- Analogues of Poisson's Summation FormulaThe American Mathematical Monthly, 1962