Lower bound for bilinear complexity of matrix multiplication over a finite field

Recieved: 05/21/2023

Accepted: 07/18/2023

Published: 11/28/2023

Keywords: bilinear complexity, lower bound, matrix multiplication, finite field

To cite this article

Nazarov A.A. Lower bound for bilinear complexity of matrix multiplication over a finite field. // Moscow University Journal. Series 15. Computational Mathematics and Cybernetics. 2023. N 4, p.41-53 https://doi.org/10.55959/MSU/0137–0782–15–2023–47–4–41–53.

This work is licensed under a Сreative Commons Atribiution - NonCommercial 4.0 International (CC BY-NC 4.0)

Nazarov A.A. (Lomonosov Moscow State University (MSU))

Abstract

The lower bound for bilinear complexity of multiplication of arbitrary matrices over finite fields is improved.