Pages that link to "Item:Q3886825"
From MaRDI portal
The following pages link to Fast computation of discrete Fourier transforms using polynomial transforms (Q3886825):
Displayed 9 items.
- A note on prime factor FFT algorithms (Q1050757) (← links)
- Abelian semi-simple algebras and algorithms for the discrete Fourier transform (Q1060551) (← links)
- Index transforms for N-dimensional DFT's (Q1093355) (← links)
- The inverse of an automorphism in polynomial time (Q1190750) (← links)
- 2-D FFT algorithm by matrix factorization in a 2-D space (Q1316209) (← links)
- Vector coding algorithms for multidimensional discrete Fourier transform (Q2475397) (← links)
- Integer multiplication in time \(O(n\log n)\) (Q2662018) (← links)
- Modified FFTs for Fused Multiply-Add Architectures (Q4293974) (← links)
- Group Convolutions and Matrix Transforms (Q4721954) (← links)