On the complexity of the multiplication of matrices of small formats
From MaRDI portal
Publication:1394936
DOI10.1016/S0885-064X(02)00007-9zbMath1026.68062MaRDI QIDQ1394936
Publication date: 25 June 2003
Published in: Journal of Complexity (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
Related Items
On the Geometry of Border Rank Decompositions for Matrix Multiplication and Other Tensors with Symmetry, On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices, Optimization techniques for small matrix multiplication, Semisimple algebras of almost minimal rank over the reals, A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices, On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication, Improving the Numerical Stability of Fast Matrix Multiplication, The bilinear complexity and practical algorithms for matrix multiplication, Group-Theoretic Lower Bounds for the Complexity of Matrix Multiplication, Geometry and the complexity of matrix multiplication
Cites Work
- Unnamed Item
- Matrix multiplication via arithmetic progressions
- Lectures on the complexity of bilinear problems
- On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping
- On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication
- On the algorithmic complexity of associative algebras
- On the optimal evaluation of a set of bilinear forms
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- Lower bounds for the multiplicative complexity of matrix multiplication
- Gaussian elimination is not optimal
- On multiplication of 2 \(\times\) 2 matrices
- Relative bilinear complexity and matrix multiplication.
- Noncommutative Bilinear Algorithms for $3 \times 3$ Matrix Multiplication
- Partial and Total Matrix Multiplication
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- On Winograd's Algorithm for Inner Products
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- Lower bounds for the bilinear complexity of associative algebras
