The following pages link to (Q4864906):
Displaying 5 items.
- Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses (Q3355210) (← links)
- Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms (Q3482811) (← links)
- A Generalized Prime Factor FFT Algorithm for any $N = 2^p 3^q 5^r $ (Q3992213) (← links)
- On the multiplicative complexity of discrete cosine transforms (Q4014159) (← links)
- (Q4040743) (← links)