Pages that link to "Item:Q3448770"
From MaRDI portal
The following pages link to Tighter Fourier Transform Lower Bounds (Q3448770):
Displaying 6 items.
- The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform (Q2224843) (← links)
- Paraunitary matrices, entropy, algebraic condition number and Fourier computation (Q2304569) (← links)
- An \(\mathrm{Omega}((n \log n)/R)\) lower bound for Fourier transform computation in the \(R\)-well conditioned model (Q2828217) (← links)
- Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses (Q3355210) (← links)
- Tighter Fourier Transform Lower Bounds (Q3448770) (← links)
- Lower bounds for the Dyadic Hilbert transform (Q4568278) (← links)
