{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:31:20Z","timestamp":1772119880037,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T00:00:00Z","timestamp":1721088000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-15-IDEX-0002,ANR-21-CE39-0006,ANR-22-PECY-0010"],"award-info":[{"award-number":["ANR-15-IDEX-0002,ANR-21-CE39-0006,ANR-22-PECY-0010"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,16]]},"DOI":"10.1145\/3666000.3669697","type":"proceedings-article","created":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T13:18:51Z","timestamp":1721049531000},"page":"254-263","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Strassen's algorithm is not optimally accurate"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2591-172X","authenticated-orcid":false,"given":"Jean-Guillaume","family":"Dumas","sequence":"first","affiliation":[{"name":"Laboratoire Jean Kuntzmann, Université Grenoble Alpes, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6970-0417","authenticated-orcid":false,"given":"Cl\u00e9ment","family":"Pernet","sequence":"additional","affiliation":[{"name":"Laboratoire Jean Kuntzmann, Université Grenoble Alpes, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3225-8631","authenticated-orcid":false,"given":"Alexandre","family":"Sedoglavic","sequence":"additional","affiliation":[{"name":"Centre de Recherche en Informatique, Signal eT Automatique de Lille, Université de Lille, France"}]}],"member":"320","published-online":{"date-parts":[[2024,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"G. Ballard A.R. Benson A. Druinsky B. Lipshitz and O. Schwartz. 2016. Improving the Numerical Stability of Fast Matrix Multiplication. siamJournal on Matrix Analysis and Applications 37 4 (2016) 1382\u20131418. 10.1137\/15M1032168","DOI":"10.1137\/15M1032168"},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the 24th acmSymposium on Parallelism in Algorithms and Architectures","author":"Ballard G.","year":"2005","unstructured":"G. Ballard, J. Demmel, O. Holtz, B. Lipshitz, and O. Schwartz. 2012. Communication-Optimal Parallel Algorithm for Strassen\u2019s Matrix Multiplication. In spaa\u201912: Proceedings of the 24th acmSymposium on Parallelism in Algorithms and Architectures (Pittsburgh, pa, usa), 193\u2013204. 10.1145\/2312005.2312044"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of the 31st acmSymposium on Parallel Algorithms and Architectures (Phoenix, az, usa), 11\u201322","author":"Beniamini G.","unstructured":"G. Beniamini and O. Schwartz. 2019. Fast Matrix multiplication via sparse decomposition. In spaa\u201919: Proceedings of the 31st acmSymposium on Parallel Algorithms and Architectures (Phoenix, az, usa), 11\u201322. 10.1145\/3323165.3323188"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01395989"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/860854.860870"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-012-9124-7"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"R.P. Brent. 1970. Algorithms for matrix multiplication. Technical Reportstan-cs-70-157. C.S. Dpt. Standford University.","DOI":"10.21236\/AD0705509"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-023-01377-5"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-007-0114-x"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-007-0061-6"},{"key":"e_1_3_2_1_11_1","unstructured":"J-G. Dumas B. Grenet C. Pernet and A. Sedoglavic. 2024. PLinOpt a collection of C++ routines handling linear & bilinear programs. v2.3 50ee789. https:\/\/github.com\/jgdumas\/plinopt(1.7\u00a0ksloc)."},{"key":"e_1_3_2_1_12_1","unstructured":"J-G. Dumas C. Pernet and A. Sedoglavic. 2024. Matlab accurate fast matrix multiplications via\u00a02 \u00d7 2 recursion. v1.0 52db87c. https:\/\/github.com\/jgdumas\/Fast-Matrix-Multiplication(1.6\u00a0ksloc)."},{"key":"e_1_3_2_1_13_1","unstructured":"J.A. Grochow and C. Moore. 2016. Matrix multiplication algorithms from group orbits. Technical ReportarXiv:arXiv:1612.01527"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(78)90038-5"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(78)90045-2"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"N.J. Higham. 2002. Accuracy and Stability of Numerical Algorithms (2 ed.). siam. 10.1137\/1.9780898718027","DOI":"10.1137\/1.9780898718027"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"J.E. Hopcroft and J. Musinski. 1973. Duality Applied to the Complexity of Matrix Multiplications and other Bilinear Forms. In 5thacmSymposium on the theory of computing (Austin tx usa) 73\u201387. 10.1137\/0202013","DOI":"10.1145\/800125.804038"},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of the 29th acmSymposium on Parallelism in Algorithms and Architectures (Washington, dc, usa), 101\u2013110","author":"Karstadt E.","unstructured":"E. Karstadt and O. Schwartz. 2017. Matrix Multiplication, a Little Faster. In spaa\u201917: Proceedings of the 29th acmSymposium on Parallelism in Algorithms and Architectures (Washington, dc, usa), 101\u2013110. 10.1145\/3087556.3087579"},{"key":"e_1_3_2_1_19_1","volume-title":"Vol.\u00a0169","author":"Landsberg J.M.","year":"1831","unstructured":"J.M. Landsberg. 2016. Geometry and complexity theory. csam, Vol.\u00a0169. Cambridge University Press. 10.1017\/9781108183192"},{"key":"e_1_3_2_1_20_1","first-page":"1","article-title":"Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications","volume":"59","author":"Ozaki K.","year":"2012","unstructured":"K. Ozaki, T. Ogita, S. Oishi, and S.\u00a0M. Rump. 2012. Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications. Numerische Algorithms 59, 1 (Jan. 2012), 95\u2013118. 10.1007\/S11075-011-9478-1","journal-title":"Numerische Algorithms"},{"key":"e_1_3_2_1_21_1","volume-title":"proceedings of the 38th ieeeInternational Parallel Distributed Processing Symposium","author":"Schwartz O.","unstructured":"O. Schwartz, S. Toledd, N. Vaknim, and G. Wiernik. 2024. Alternative Basis Matrix Multiplication is fast and stable. In ipdps\u201924: proceedings of the 38th ieeeInternational Parallel Distributed Processing Symposium, (San Francisco, ca, usa)."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"e_1_3_2_1_23_1","first-page":"956","article-title":"La complexit\u00e9 des calculs num\u00e9riques","volume":"8","author":"Winograd S.","year":"1977","unstructured":"S. Winograd. 1977. La complexit\u00e9 des calculs num\u00e9riques. La Recherche 8 (1977), 956\u2013963.","journal-title":"La Recherche"}],"event":{"name":"ISSAC '24: International Symposium on Symbolic and Algebraic Computation","location":"Raleigh NC USA","acronym":"ISSAC '24","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"]},"container-title":["Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3666000.3669697","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3666000.3669697","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:53:47Z","timestamp":1758588827000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3666000.3669697"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,16]]},"references-count":23,"alternative-id":["10.1145\/3666000.3669697","10.1145\/3666000"],"URL":"https:\/\/doi.org\/10.1145\/3666000.3669697","relation":{},"subject":[],"published":{"date-parts":[[2024,7,16]]},"assertion":[{"value":"2024-07-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}