On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field

DOI10.3103/S0278641919040022zbMath1473.68094OpenAlexW2996524277MaRDI QIDQ2191009

Yanyan Li

Publication date: 23 June 2020

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0278641919040022

zbMATH Keywords

complexityfinite fieldmultiplication of matricesbilinear complexity

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
• On the complexity of the multiplication of matrices of small formats
• Gaussian elimination is not optimal
• On multiplication of 2 \(\times\) 2 matrices
• On the complexity of some algorithms of matrix multiplication
• A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
• New Lower Bounds for the Rank of Matrix Multiplication

This page was built for publication: On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field