发布求助
文献互助 智能选刊 最新文献

The Approximate Bilinear Complexity of the Multiplication of Matrices of Sizes $$2\times n$$ and $$n\times 4$$

Moscow University Computational Mathematics and Cybernetics Pub Date : 2023-05-01 DOI:10.3103/s027864192302005x
A. A. Nazarov, A. V. Smirnov
{"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}
引用次数: 0
分享
查看原文 本刊更多论文
大小矩阵乘法的近似双线性复杂度$$2\times n$$和 $$n\times 4$$
本文章由计算机程序翻译，如有差异，请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Moscow University Computational Mathematics and Cybernetics
Moscow University Computational Mathematics and Cybernetics
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信