Faster rectangular matrix multiplication by combination loss analysis
From MaRDI portal
Cited in
(8)- Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication
- On the cut-vertex and the interval transit functions of hypergraphs
- Training multi-layer over-parametrized neural network in subquadratic time
- Faster algorithms for Schatten-p low rank approximation
- Matrix multiplication verification using coding theory
- Barriers for rectangular matrix multiplication
- Powers of low rank sparse matrices
- Reducing isotropy and volume to KLS: faster rounding and volume algorithms
This page was built for publication: Faster rectangular matrix multiplication by combination loss analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645499)
