A Lower Bound for Matrix Multiplication
From MaRDI portal
Recommendations
- Lower bounds for the multiplicative complexity of matrix multiplication
- A matrix lower bound
- Lower Bounds for Matrix Product
- Lower bounds for matrices
- New lower bounds for the rank of matrix multiplication
- Lower bounds of matrices
- Lower bounds for some matrices
- Improved bound for complexity of matrix multiplication
- On obtaining upper bounds on the complexity of matrix multiplication
- On lower and upper bounds of matrices
Cited in
(15)- New methods for binary multiplication
- The lower-bound estimate of \(D[X_{2m}]\) and fast construction of matrix \(X_{2m}\)
- On the Reuse of Additions in Matrix Multiplication
- Fast matrix multiplication and its algebraic neighbourhood
- A lower bound for periods of matrices
- Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications.
- On the complexity of some algorithms of matrix multiplication
- Lower Bounds for Matrix Product
- Lower bounds on zero-one matrices.
- Improved bound for complexity of matrix multiplication
- Multiplicative complexity of direct sums of quadratic systems
- Beyond the Alder-Strassen bound.
- New lower bounds for the rank of matrix multiplication
- scientific article; zbMATH DE number 4172392 (Why is no real title available?)
- Entropy of operators or why matrix multiplication is hard for depth-two circuits
This page was built for publication: A Lower Bound for Matrix Multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4203811)
