Pages that link to "Item:Q1394936"
From MaRDI portal
The following pages link to On the complexity of the multiplication of matrices of small formats (Q1394936):
Displayed 10 items.
- On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices (Q483185) (← links)
- Optimization techniques for small matrix multiplication (Q533859) (← links)
- Semisimple algebras of almost minimal rank over the reals (Q1034526) (← links)
- A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices (Q2354472) (← links)
- On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication (Q2444860) (← links)
- Improving the Numerical Stability of Fast Matrix Multiplication (Q2827068) (← links)
- The bilinear complexity and practical algorithms for matrix multiplication (Q2940335) (← links)
- Group-Theoretic Lower Bounds for the Complexity of Matrix Multiplication (Q3010380) (← links)
- Geometry and the complexity of matrix multiplication (Q3498865) (← links)
- On the Geometry of Border Rank Decompositions for Matrix Multiplication and Other Tensors with Symmetry (Q5347291) (← links)