A Fast Computer Method for Matrix Transposing
From MaRDI portal
Cited in
(5)- Transposition of an \(\ell \times \ell\) matrix requires \(\Omega\) (log \(\ell)\) reversals on conservative Turing machines
- Two dimensional fast Fourier transform for large data matrices
- Matrix transpose on meshes with wormhole and XY routing
- More efficient oblivious transfer extensions
- A general transposition method for a matrix on auxiliary store
This page was built for publication: A Fast Computer Method for Matrix Transposing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5649368)