Pages that link to "Item:Q811112"
From MaRDI portal
The following pages link to Improved upper complexity bounds for the discrete Fourier transform (Q811112):
Displaying 9 items.
- Existence and efficient construction of fast Fourier transforms on supersolvable groups (Q685713) (← links)
- Double coset decompositions and computational harmonic analysis on groups (Q1581065) (← links)
- Variations on computing reciprocals of power series (Q1607045) (← links)
- On the real complexity of a complex DFT (Q1752320) (← links)
- The efficient computation of Fourier transforms on semisimple algebras (Q1783700) (← links)
- Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses (Q3355210) (← links)
- Energy Packing Efficiency for the Generalized Discrete Transforms (Q4166681) (← links)
- Upper and Lower Bounds on Time-Space Tradeoffs for Computations with Embedded Fast Fourier Transforms (Q4729344) (← links)
- Fast Fourier Analysis for SL<sub>2</sub>over a Finite Field and Related Numerical Experiments (Q5285858) (← links)