David Cash, Dennis Hofheinz, et al.
Journal of Cryptology
Paper
The multiplicative complexity of the Discrete Fourier Transform
Abstract
We show how to compute the multiplicative complexity of the Discrete Fourier Transform on any set of data points. © 1984.
Related
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
A. Skumanich
SPIE OE/LASE 1992
Trang H. Tran, Lam Nguyen, et al.
INFORMS 2022