Back to Search
Start Over
A Lower Bound for Bilinear Complexity of Matrix Multiplication over a Finite Field.
- Source :
- Moscow University Computational Mathematics & Cybernetics; Dec2023, Vol. 47 Issue 4, p218-231, 14p
- Publication Year :
- 2023
-
Abstract
- An improved lower bound is found for the bilinear complexity of the multiplication of arbitrary matrices over finite fields. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 02786419
- Volume :
- 47
- Issue :
- 4
- Database :
- Complementary Index
- Journal :
- Moscow University Computational Mathematics & Cybernetics
- Publication Type :
- Academic Journal
- Accession number :
- 175233310
- Full Text :
- https://doi.org/10.3103/S0278641923040155