Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
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
Conference paper
Modeling polarization for Hyper-NA lithography tools and masks
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
W.C. Tang, H. Rosen, et al.
SPIE Optics, Electro-Optics, and Laser Applications in Science and Engineering 1991
Fernando Martinez, Tao Li, et al.
ICLR 2026