有限域上2 × 2-矩阵乘以2 × m-矩阵的双线性复杂度

{"title":"有限域上2 × 2-矩阵乘以2 × m-矩阵的双线性复杂度","authors":"V. Alekseev, A. Nazarov","doi":"10.3103/S0278641919040022","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":170066,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Bilinear Complexity of Multiplying 2 × 2-Matrix by 2 × m-Matrix over Finite Field\",\"authors\":\"V. Alekseev, A. Nazarov\",\"doi\":\"10.3103/S0278641919040022\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":170066,\"journal\":{\"name\":\"Moscow University Computational Mathematics and Cybernetics\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"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/S0278641919040022\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Moscow University Computational Mathematics and Cybernetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3103/S0278641919040022","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}