{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T03:13:02Z","timestamp":1783653182049,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T00:00:00Z","timestamp":1690156800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P31571-N32,I6130-N"],"award-info":[{"award-number":["P31571-N32,I6130-N"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,24]]},"DOI":"10.1145\/3597066.3597120","type":"proceedings-article","created":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T18:15:27Z","timestamp":1688580927000},"page":"381-388","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Flip Graphs for Matrix Multiplication"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8641-6661","authenticated-orcid":false,"given":"Manuel","family":"Kauers","sequence":"first","affiliation":[{"name":"Johannes Kepler University, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0634-4854","authenticated-orcid":false,"given":"Jakob","family":"Moosbauer","sequence":"additional","affiliation":[{"name":"Johannes Kepler University, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.32"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0885-064X(02)00007-9"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Richard\u00a0P. Brent. 1970. Algorithms for matrix multiplication. Technical Report. Department of Computer Science Stanford.","DOI":"10.21236\/AD0705509"},{"key":"e_1_3_2_1_4_1","volume-title":"Algebraic complexity theory. Vol.\u00a0315","author":"B\u00fcrgisser Peter","unstructured":"Peter B\u00fcrgisser, Michael Clausen, and Mohammad\u00a0A Shokrollahi. 2013. Algebraic complexity theory. Vol.\u00a0315. Springer Berlin Heidelberg, Berlin, Heidelberg."},{"key":"e_1_3_2_1_5_1","unstructured":"Nicolas\u00a0T. Courtois Gregory\u00a0V. Bard and Daniel Hulme. 2011. A New General-Purpose Method to Multiply 3 \u00d7 3 Matrices Using Only 23 Multiplications. Technical Report 1108.2830. ArXiv. https:\/\/doi.org\/10.48550\/ARXIV.1108.2830"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(78)90045-2"},{"key":"e_1_3_2_1_7_1","unstructured":"Ran Duan Hongxun Wu and Renfei Zhou. 2022. Faster Matrix Multiplication via Asymmetric Hashing. Technical Report 2210.10173. arXiv. https:\/\/doi.org\/10.48550\/ARXIV.2210.10173"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-022-05172-4"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-24258-9_10"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2020.10.003"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0120004"},{"key":"e_1_3_2_1_12_1","unstructured":"Manuel Kauers and Jakob Moosbauer. 2022. The FBHHRBNRSSSHK-Algorithm for Multiplication in is still not the end of the story. Technical Report 2210.04045. arXiv. https:\/\/doi.org\/10.48550\/ARXIV.2210.04045"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-19685-0_11"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1976-13988-2"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0209027"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3452143.3465537"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542513120129"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"e_1_3_2_1_19_1","volume-title":"Modern Computer Algebra (3 ed.)","author":"von Zur\u00a0Gathen Joachim","unstructured":"Joachim von Zur\u00a0Gathen and J\u00fcrgen Gerhard. 2013. Modern Computer Algebra (3 ed.). Cambridge University Press."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(71)90009-7"}],"event":{"name":"ISSAC 2023: International Symposium on Symbolic and Algebraic Computation 2023","location":"Troms\u00f8 Norway","acronym":"ISSAC 2023"},"container-title":["Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3597066.3597120","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3597066.3597120","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T09:36:04Z","timestamp":1755855364000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3597066.3597120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,24]]},"references-count":20,"alternative-id":["10.1145\/3597066.3597120","10.1145\/3597066"],"URL":"https:\/\/doi.org\/10.1145\/3597066.3597120","relation":{},"subject":[],"published":{"date-parts":[[2023,7,24]]},"assertion":[{"value":"2023-07-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}