A lower bound for bilinear complexity of matrix multiplication over a finite field

DOI10.3103/S0278641923040155MaRDI QIDQ6545499zbMATH OpenFDO

Authors A. A. Nazarov

Publication date 29 May 2024

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

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

zbMATH Keywords

bilinear complexityfinite fieldlower boundmatrix multiplication

Mathematics Subject Classification ID

Numerical linear algebra (65Fxx) Theory of computing (68Qxx) Algorithms in computer science (68Wxx)

Cites work

• Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
• From the editor of this issue
• Gaussian elimination is not optimal
• scientific article; zbMATH DE number 4088834 (Why is no real title available?)
• Matrix multiplication via arithmetic progressions
• New lower bounds for the rank of 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
• 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

This page was built for publication: A lower bound for bilinear complexity of matrix multiplication over a finite field

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545499)