Pages that link to "Item:Q2224843"
From MaRDI portal
The following pages link to The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform (Q2224843):
Displaying 4 items.
- 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)
- (Q3613906) (← links)
- A lower bound for Fourier transform computation in a linear model over \(2\times 2\) unitary gates using matrix entropy (Q5414631) (← links)
