Journal of the ACM Bibliography
Jacques Morgenstern. Note
on a lower bound on the linear complexity of the fast Fourier transform.
Journal of the ACM, 20(2):305-306, April 1973.
[BibTeX entry]
Additional Key Words and Phrases:
numerical algorithms, fast Fourier transform, matrix product
Selected papers that cite this one
- Bernard Chazelle. Lower bounds for off-line
range searching. In Proceedings of the Twenty-Seventh Annual
ACM Symposium on the Theory of Computing, pages 733-740, Las
Vegas, Nevada, 29 May-1 June 1995.
- Bernard Chazelle. A spectral
approach to lower bounds with applications to geometric searching.
SIAM Journal on Computing, 27(2):545-556, March 1998.
- Noam Nisan and Avi Wigderson. On the complexity of
bilinear forms. In Proceedings of the Twenty-Seventh Annual
ACM Symposium on the Theory of Computing, pages 723-732, Las
Vegas, Nevada, 29 May-1 June 1995.
Shortcuts: