Answers are grounded in this paper and cite their sources.
New algorithms for computing the Discrete Fourier Transform of n points are described. For n in the range of a few tens to a few thousands these algorithms use substantially fewer multiplications than the best algorithm previously known, and about the same number of additions.
No takes yet. Share an insight, caveat, or question.
S. Winograd (1976) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: