大小矩阵乘法的近似双线性复杂度$$2\times n$$和 $$n\times 4$$

{"title":"大小矩阵乘法的近似双线性复杂度$$2\\times n$$和 $$n\\times 4$$","authors":"A. A. Nazarov, A. V. Smirnov","doi":"10.3103/s027864192302005x","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":498074,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Approximate Bilinear Complexity of the Multiplication of Matrices of Sizes $$2\\\\times n$$ and $$n\\\\times 4$$\",\"authors\":\"A. A. Nazarov, A. V. Smirnov\",\"doi\":\"10.3103/s027864192302005x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":498074,\"journal\":{\"name\":\"Moscow University Computational Mathematics and Cybernetics\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-05-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/s027864192302005x\",\"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/s027864192302005x","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}