Generalization of a FFT with powers of 3

Asked Sep 18 '15 at 14:10

Active Sep 18 '15 at 14:10

Viewed 579 times

I'm not satisfied with the current answers asked about this on MathSE. So I'm going to ask:

Describe the generalization of the FFT algorithm to the case in which n is a power of 3. What's the runtime?

asked Sep 18 '15 at 14:10

throwawayhmwk

0 Answers0