A lower bound for bilinear complexity of matrix multiplication over a finite field
From MaRDI portal
Publication:6545499
DOI10.3103/s0278641923040155MaRDI QIDQ6545499
Publication date: 29 May 2024
Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)
This page was built for publication: A lower bound for bilinear complexity of matrix multiplication over a finite field