Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Jacques Morgenstern Mathématiques et Sciences Théoriques, Université de Nice, Nice, France
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 20 Issue 2, April 1973
Pages 305-306
ACM New York, NY, USA
table of contents doi>10.1145/321752.321761
Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform Published by ACM 1973 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 31
· Downloads (cumulative): 452
· Citation Count: 14


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder