{"title":"A Lower Bound for Bilinear Complexity of Matrix Multiplication over a Finite Field","authors":"A. A. Nazarov","doi":"10.3103/s0278641923040155","DOIUrl":null,"url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>An improved lower bound is found for the bilinear complexity of the multiplication of arbitrary matrices over finite fields.</p>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"15 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Moscow University Computational Mathematics and Cybernetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3103/s0278641923040155","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
An improved lower bound is found for the bilinear complexity of the multiplication of arbitrary matrices over finite fields.