Answers are grounded in this paper and cite their sources.
A graph-theoretic model for a class of linear algorithms computing the discrete Fourier transform of sequences of length a power of 2, the mformat~on flow network, is presented The information flow network correspondmg to the fast Fourier transform IS shown to be umquely optimal in tim class with respect to a naturally defined cost
No takes yet. Share an insight, caveat, or question.
Christos H. Papadimitriou (1979) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: