{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T14:18:46Z","timestamp":1778077126719,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","funder":[{"name":"EPSRC","award":["EP\/W014882\/2"],"award-info":[{"award-number":["EP\/W014882\/2"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,28]]},"DOI":"10.1145\/3747199.3747566","type":"proceedings-article","created":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T10:51:17Z","timestamp":1762771877000},"page":"233-239","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Flip Graphs with Symmetry and New Matrix Multiplication Schemes"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0634-4854","authenticated-orcid":false,"given":"Jakob","family":"Moosbauer","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Warwick, Coventry, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-6654-5831","authenticated-orcid":false,"given":"Michael","family":"Poole","sequence":"additional","affiliation":[{"name":"Independent Researcher, Wantage, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2025,11,10]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.63"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3666000.3669701"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","unstructured":"Grey Ballard Christian Ikenmeyer J.M. Landsberg and Nick Ryder. 2019. The geometry of rank decompositions of matrix multiplication II: 3 \u00d7 3 matrices. Journal of Pure and Applied Algebra 223 8 (2019) 3205\u20133224. 10.1016\/j.jpaa.2018.10.014","DOI":"10.1016\/j.jpaa.2018.10.014"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.5555\/891861"},{"key":"e_1_3_3_1_6_2","unstructured":"Vladimir Burichenko. 2022. On automorphism group of a possible short algorithm for multiplication of 3 \u00d7 3 matrices. arxiv:https:\/\/arXiv.org\/abs\/2211.06485\u00a0[cs.CC] https:\/\/arxiv.org\/abs\/2211.06485"},{"key":"e_1_3_3_1_7_2","unstructured":"V.\u00a0P. Burichenko. 2015. Symmetries of matrix multiplication algorithms. I. arxiv:https:\/\/arXiv.org\/abs\/1508.01110\u00a0[cs.CC] https:\/\/arxiv.org\/abs\/1508.01110"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","unstructured":"Don Coppersmith and Shmuel Winograd. 1990. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation 9 3 (1990) 251\u2013280. 10.1016\/S0747-7171(08)80013-2Computational algebraic complexity editorial.","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","unstructured":"Hans\u00a0F. de Groote. 1978. On varieties of optimal algorithms for the computation of bilinear mappings I. the isotropy group of a bilinear mapping. Theoretical Computer Science 7 1 (1978) 1\u201324. 10.1016\/0304-3975(78)90038-5","DOI":"10.1016\/0304-3975(78)90038-5"},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"publisher","unstructured":"Hans\u00a0F. de Groote. 1978. On varieties of optimal algorithms for the computation of bilinear mappings II. Optimal algorithms for 2 \u00d7 2-matrix multiplication. Theoretical Computer Science 7 2 (1978) 127\u2013148. 10.1016\/0304-3975(78)90045-2","DOI":"10.1016\/0304-3975(78)90045-2"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"publisher","unstructured":"Charles-\u00c9ric Drevet Md. Nazrul Islam and \u00c9ric Schost. 2011. Optimization techniques for small matrix multiplication. Theoretical Computer Science 412 22 (2011) 2219\u20132236. 10.1016\/j.tcs.2010.12.012","DOI":"10.1016\/j.tcs.2010.12.012"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"publisher","unstructured":"Alhussein Fawzi Matej Balog Aja Huang Thomas Hubert Bernardino Romera-Paredes Mohammadamin Barekatain Alexander Novikov Francisco J.\u00a0R. Ruiz Julian Schrittwieser Grzegorz Swirszcz David Silver Demis Hassabis and Pushmeet Kohli. 2022. Discovering faster matrix multiplication algorithms with reinforcement learning. Nature 610 7930 (2022) 47\u201353. 10.1038\/s41586-022-05172-4","DOI":"10.1038\/s41586-022-05172-4"},{"key":"e_1_3_3_1_13_2","unstructured":"Joshua\u00a0A. Grochow and Cristopher Moore. 2016. Matrix multiplication algorithms from group orbits. arxiv:https:\/\/arXiv.org\/abs\/1612.01527\u00a0[cs.CC] https:\/\/arxiv.org\/abs\/1612.01527"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"publisher","unstructured":"Marijn\u00a0J.H. Heule Manuel Kauers and Martina Seidl. 2021. New ways to multiply 3 \u00d7 3-matrices. J. Symbolic Comput. 104 (2021) 899\u2013916. 10.1016\/j.jsc.2020.10.003","DOI":"10.1016\/j.jsc.2020.10.003"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-24258-9_10"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"publisher","unstructured":"J.\u00a0E. Hopcroft and L.\u00a0R. Kerr. 1971. On Minimizing the Number of Multiplications Necessary for Matrix Multiplication. SIAM J. Appl. Math. 20 1 (1971) 30\u201336. 10.1137\/0120004","DOI":"10.1137\/0120004"},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3597066.3597120"},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"publisher","unstructured":"Manuel Kauers and Jakob Moosbauer. 2025. Some New Non-Commutative Matrix Multiplication Algorithms of Size (n m 6). ACM Commun. Comput. Algebra 58 1 (Jan. 2025) 1\u201311. 10.1145\/3712020.3712021","DOI":"10.1145\/3712020.3712021"},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"publisher","unstructured":"Julian\u00a0D. Laderman. 1976. A noncommutative algorithm for multiplying 3 \u00d7 3 matrices using 23 multiplications. Bull. Amer. Math. Soc. 82 1 (1976) 126\u2013128. 10.1090\/S0002-9904-1976-13988-2","DOI":"10.1090\/S0002-9904-1976-13988-2"},{"key":"e_1_3_3_1_20_2","unstructured":"Alexandre Sedoglavic. 2017. A non-commutative algorithm for multiplying (7 x 7) matrices using 250 multiplications. (Aug. 2017). https:\/\/hal.science\/hal-01572046 working paper or preprint."},{"key":"e_1_3_3_1_21_2","unstructured":"Alexandre Sedoglavic. 2023. Yet another catalogue of fast matrix multiplication algorithms. https:\/\/fmm.univ-lille.fr\/. Accessed on June 11 2023."},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"publisher","unstructured":"Alexey\u00a0V. Smirnov. 2013. The bilinear complexity and practical algorithms for matrix multiplication. Zh. Vychisl. Mat. Mat. Fiz. 53 12 (2013) 1970\u20131984. 10.1134\/S0965542513120129","DOI":"10.1134\/S0965542513120129"},{"key":"e_1_3_3_1_23_2","doi-asserted-by":"publisher","unstructured":"Volker Strassen. 1969. Gaussian elimination is not optimal. Numer. Math. 13 (1969) 354\u2013356. 10.1007\/BF02165411","DOI":"10.1007\/BF02165411"},{"key":"e_1_3_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139856065"}],"event":{"name":"ISSAC '25: International Symposium on Symbolic and Algebraic Computation","location":"Guanajuato Mexico","acronym":"ISSAC '25","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"]},"container-title":["Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3747199.3747566","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T11:38:59Z","timestamp":1762774739000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3747199.3747566"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,28]]},"references-count":23,"alternative-id":["10.1145\/3747199.3747566","10.1145\/3747199"],"URL":"https:\/\/doi.org\/10.1145\/3747199.3747566","relation":{},"subject":[],"published":{"date-parts":[[2025,7,28]]},"assertion":[{"value":"2025-11-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}