Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
Paper
On computing the discrete fourier transform
Abstract
A new algorithm for computing the Discrete Fourier Transform is described. The algorithm is based on a recent result in complexity theory which enables us to derive efficient algorithms for convolution. These algorithms are then used to obtain the new Discrete Fourier Transform algorithm. © 1978 American Mathematical Society.
Related
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992
Matthew A Grayson
Journal of Complexity
Amir Ali Ahmadi, Raphaël M. Jungers, et al.
SICON