{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T14:00:43Z","timestamp":1762783243505,"version":"3.41.0"},"reference-count":11,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2024,3]]},"abstract":"<jats:p>\n            For various 2 \u2264\n            <jats:italic>n, m<\/jats:italic>\n            \u2264 6, we propose some new algorithms for multiplying an\n            <jats:italic>n<\/jats:italic>\n            x\n            <jats:italic>m<\/jats:italic>\n            matrix with an\n            <jats:italic>m<\/jats:italic>\n            x 6 matrix over a possibly noncommutative coefficient ring.\n          <\/jats:p>","DOI":"10.1145\/3712020.3712021","type":"journal-article","created":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T16:56:46Z","timestamp":1736528206000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Some New Non-Commutative Matrix Multiplication Algorithms of Size (\n            <i>n, m<\/i>\n            , 6)"],"prefix":"10.1145","volume":"58","author":[{"given":"Manuel","family":"Kauers","sequence":"first","affiliation":[{"name":"Institute for Algebra, Johannes Kepler University, Linz, Austria"}]},{"given":"Jakob","family":"Moosbauer","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Warwick, Coventry, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2025,1,10]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Algebraic complexity theory","author":"B\u00fcrgisser Peter","year":"2013","unstructured":"Peter B\u00fcrgisser, Michael Clausen, and Mohammad A Shokrollahi. Algebraic complexity theory, volume 315. Springer Science & Business Media, 2013."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-022-05172-4"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2020.10.003"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/0120004"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3597066.3597120"},{"key":"e_1_2_1_6_1","volume-title":"AMS","author":"Landsberg Joseph M.","year":"2011","unstructured":"Joseph M. Landsberg. Tensors: Geometry and Applications. AMS, 2011."},{"key":"e_1_2_1_7_1","volume-title":"Yet another catalogue of fast matrix multiplication algorithms. https:\/\/fmm.univ-lille.fr\/","author":"Sedoglavic Alexandre","year":"2023","unstructured":"Alexandre Sedoglavic. Yet another catalogue of fast matrix multiplication algorithms. https:\/\/fmm.univ-lille.fr\/, 2023."},{"key":"e_1_2_1_8_1","first-page":"345","volume-title":"Proc. ISSAC'21","author":"Sedoglavic Alexandre","year":"2021","unstructured":"Alexandre Sedoglavic and Alexey V. Smirnov. The tensor rank of 5 x 5 matrices multiplication is bounded by 98 and its border rank by 89. In Proc. ISSAC'21, pages 345--351, 2021."},{"issue":"12","key":"e_1_2_1_9_1","first-page":"1970","article-title":"The bilinear complexity and practical algorithms for matrix multiplication","volume":"53","author":"Smirnov Alexey V.","year":"2013","unstructured":"Alexey V. Smirnov. The bilinear complexity and practical algorithms for matrix multiplication. Zh. Vychisl. Mat. Mat. Fiz., 53(12):1970--1984, 2013.","journal-title":"Zh. Vychisl. Mat. Mat. Fiz."},{"key":"e_1_2_1_10_1","volume-title":"Bilinear algorithm &lt;4,4,6","author":"Smirnov Alexey V.","year":"2023","unstructured":"Alexey V. Smirnov. Bilinear algorithm &lt;4,4,6; 73&gt; for matrix multiplication. https:\/\/www.researchgate.net\/publication\/366989954_Bilinear_Algorithm_4_4_6_73_for_Matrix_Multiplication\/, 2023."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3712020.3712021","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3712020.3712021","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:10Z","timestamp":1750295890000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3712020.3712021"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["10.1145\/3712020.3712021"],"URL":"https:\/\/doi.org\/10.1145\/3712020.3712021","relation":{},"ISSN":["1932-2232","1932-2240"],"issn-type":[{"type":"print","value":"1932-2232"},{"type":"electronic","value":"1932-2240"}],"subject":[],"published":{"date-parts":[[2024,3]]},"assertion":[{"value":"2025-01-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}