A Lower Bound for Bilinear Complexity of Matrix Multiplication over a Finite Field
Crossref DOI link: https://doi.org/10.3103/S0278641923040155
Published Online: 2024-02-04
Published Print: 2023-12
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Nazarov, A. A.
Text and Data Mining valid from 2023-12-01
Version of Record valid from 2023-12-01
Article History
Received: 21 May 2023
Revised: 18 July 2023
Accepted: 18 July 2023
First Online: 4 February 2024
CONFLICT OF INTEREST
: The author of this work declares that he has no conflicts of interest.