On the approximate bilinear complexity of matrix multiplication
From MaRDI portal
Recommendations
- A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices
- On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
- The bilinear complexity and practical algorithms for matrix multiplication
- On bilinear complexity of multiplication of \(m\times 2\) and \(2\times 2\) matrices
- On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field
Cites work
- scientific article; zbMATH DE number 4088834 (Why is no real title available?)
- Gaussian elimination is not optimal
- Matrix multiplication via arithmetic progressions
- On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
- The bilinear complexity and practical algorithms for matrix multiplication
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
Cited in
(12)- On bilinear complexity of multiplication of \(m\times 2\) and \(2\times 2\) matrices
- On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field
- The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented algorithms
- A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices
- Approximate computation of scalar products
- The bilinear complexity and practical algorithms for matrix multiplication
- Refining the upper bound for the cardinality of the definition domain of universal functions for a class of linear Boolean functions
- On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
- The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\)
- Relative bilinear complexity and matrix multiplication.
- On commutativity and approximation
- On the complexity of the multiplication of matrices of small formats
This page was built for publication: On the approximate bilinear complexity of matrix multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q891131)
