On bilinear complexity of multiplication of m 2 and 2 2 matrices
From MaRDI portal
Publication:5239688
Recommendations
- On the exact and approximate bilinear complexities of multiplication of \(4\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 bilinear complexity and practical algorithms for matrix multiplication
- On the approximate bilinear complexity of matrix multiplication
- On the complexity of the multiplication of matrices of small formats
Cites work
- scientific article; zbMATH DE number 4018239 (Why is no real title available?)
- scientific article; zbMATH DE number 3461412 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
- Gaussian elimination is not optimal
- Matrix multiplication via arithmetic progressions
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- On multiplication of 2 2 matrices
- On the complexity of some algorithms of matrix multiplication
- On the complexity of the multiplication of matrices of small formats
- On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
- On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication
- The bilinear complexity and practical algorithms for matrix multiplication
Cited in
(20)- On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field
- A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices
- Equivalent polyadic decompositions of matrix multiplication tensors
- On practical algorithms for accelerated matrix multiplication
- The bilinear complexity and practical algorithms for matrix multiplication
- On the Geometry of Border Rank Algorithms for n × 2 by 2 × 2 Matrix Multiplication
- On the complexity of some algorithms of matrix multiplication
- The least number of multiplications needed for fast multiplication of \(2\times 2\) matrices of Strassen-Winograd type
- scientific article; zbMATH DE number 1464691 (Why is no real title available?)
- On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
- On the arithmetic complexity of Strassen-like matrix multiplications
- An adaptive prefix-assignment technique for symmetry reduction
- On the approximate bilinear complexity of matrix multiplication
- The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\)
- Relative bilinear complexity and matrix multiplication.
- Optimal evaluation of pairs of bilinear forms
- On the complexity of the multiplication of matrices of small formats
- Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25
- scientific article; zbMATH DE number 151736 (Why is no real title available?)
- A lower bound for bilinear complexity of matrix multiplication over a finite field
This page was built for publication: On bilinear complexity of multiplication of \(m\times 2\) and \(2\times 2\) matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5239688)
