A Lower Bound for Bilinear Complexity of Matrix Multiplication over a Finite Field
-
Published:2023-12
Issue:4
Volume:47
Page:218-231
-
ISSN:0278-6419
-
Container-title:Moscow University Computational Mathematics and Cybernetics
-
language:en
-
Short-container-title:MoscowUniv.Comput.Math.Cybern.
Reference13 articles.
1. V. Strassen, ‘‘Gaussian elimination is not optimal,’’ Numer. Math. 13 (4), 354–356 (1969). https://doi.org/10.1007/BF02165411
2. D. Coppersmith and S. Winograd, ‘‘Matrix multiplication via arithmetic progressions,’’ J. Symbolic Comput. 9 (3), 251–280 (1990). https://doi.org/10.1016/S0747-7171(08)80013-2
3. S. Winograd, ‘‘On multiplication of $$2\times 2$$ matrices,’’ Linear Algebra Appl. 4 (4), 381–388 (1971). https://doi.org/10.1016/0024-3795(71)90009-7
4. M. Bläser, ‘‘On the complexity of the multiplication of matrices of small formats,’’ J. Complexity 19 (1), 43–60 (2003). https://doi.org/10.1016/S0885-064X(02)00007-9
5. J. M. Landsberg, ‘‘New lower bounds for the rank of matrix multiplication,’’ SIAM J. Comput. 43 (1), 144–149 (2014). https://doi.org/10.1137/120880276