{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T17:13:37Z","timestamp":1783617217987,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T00:00:00Z","timestamp":1783814400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,7,13]]},"DOI":"10.1145\/3815436.3815455","type":"proceedings-article","created":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T16:11:51Z","timestamp":1783613511000},"page":"227-236","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Faster Algorithms for Structured Matrix Multiplication via Flip Graph Search"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4689-3812","authenticated-orcid":false,"given":"Kirill","family":"Khoruzhii","sequence":"first","affiliation":[{"name":"Zuse Institute Berlin, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3645-9513","authenticated-orcid":false,"given":"Patrick","family":"Gel\u00df","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7365-3000","authenticated-orcid":false,"given":"Sebastian","family":"Pokutta","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, Berlin, Germany and TU Berlin, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7,12]]},"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","unstructured":"Yamato Arai Yuma Ichikawa and Koji Hukushima. 2024. Adaptive Flip Graph Algorithm for Matrix Multiplication. arxiv:https:\/\/arXiv.org\/abs\/2312.1696010.48550\/arXiv.2312.16960","DOI":"10.48550\/arXiv.2312.16960"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","unstructured":"Shaoshi Chen and Manuel Kauers. 2025. Flip Graphs for Polynomial Multiplication. arxiv:https:\/\/arXiv.org\/abs\/2502.0626410.48550\/arXiv.2502.06264","DOI":"10.48550\/arXiv.2502.06264"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"publisher","unstructured":"Alexander Chervov Kirill Khoruzhii Nikita Bukhal Jalal Naghiyev Vladislav Zamkovoy Ivan Koltsov Lyudmila Cheldieva Arsenii Sychev Arsenii Lenin Mark Obozov Egor Urvanov and Alexey Romanov. 2025. A Machine Learning Approach That Beats Large Rubik\u2019s Cubes. arxiv:https:\/\/arXiv.org\/abs\/2502.1326610.48550\/arXiv.2502.13266","DOI":"10.48550\/arXiv.2502.13266"},{"key":"e_1_3_3_1_6_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_7_2","doi-asserted-by":"publisher","DOI":"10.52202\/068431-1189"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","unstructured":"Jack\u00a0J. Dongarra Jeremy Du\u00a0Croz Sven Hammarling and Iain\u00a0S. Duff. 1990. A Set of Level 3 Basic Linear Algebra Subprograms. ACM Trans. Math. Software 16 1 (1990) 1\u201317. 10.1145\/77626.79170","DOI":"10.1145\/77626.79170"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","unstructured":"Jean-Guillaume Dumas Pascal Giorgi and Cl\u00e9ment Pernet. 2008. Dense Linear Algebra over Word-Size Prime Fields: the FFLAS and FFPACK Packages. ACM Trans. Math. Softw. 35 3 Article 19 (Oct. 2008) 42\u00a0pages. 10.1145\/1391989.1391992","DOI":"10.1145\/1391989.1391992"},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"publisher","unstructured":"Jean-Guillaume Dumas Cl\u00e9ment Pernet and Alexandre Sedoglavic. 2021. Some Fast Algorithms Multiplying a Matrix by Its Adjoint. arxiv:https:\/\/arXiv.org\/abs\/2101.0102510.48550\/arXiv.2101.01025","DOI":"10.48550\/arXiv.2101.01025"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"publisher","unstructured":"Jean-Guillaume Dumas Cl\u00e9ment Pernet and Alexandre Sedoglavic. 2025. A Non-Commutative Algorithm for Multiplying 4x4 Matrices Using 48 Non-Complex Multiplications. arxiv:https:\/\/arXiv.org\/abs\/2506.1324210.48550\/arXiv.2506.13242","DOI":"10.48550\/arXiv.2506.13242"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"publisher","unstructured":"Jean-Guillaume Dumas Cl\u00e9ment Pernet and Alexandre Sedoglavic. 2025. Towards Automated Generation of Fast and Accurate Algorithms for Recursive Matrix Multiplication. arxiv:https:\/\/arXiv.org\/abs\/2506.1940510.48550\/arXiv.2506.19405","DOI":"10.48550\/arXiv.2506.19405"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"publisher","unstructured":"Alhussein Fawzi Matej Balog Aja Huang Thomas Hubert Bernardino Romera-Paredes Mohammadamin Barekatain Alexander Novikov Francisco\u00a0J. R.\u00a0Ruiz Julian Schrittwieser Grzegorz Swirszcz David Silver Demis Hassabis and Pushmeet Kohli. 2022. Discovering Faster Matrix Multiplication Algorithms with Reinforcement Learning. Nature 610 7930 (Oct. 2022) 47\u201353. 10.1038\/s41586-022-05172-4","DOI":"10.1038\/s41586-022-05172-4"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.56021\/9781421407944"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"publisher","unstructured":"Johan H\u00e5stad. 1990. Tensor Rank Is NP-complete. Journal of Algorithms 11 4 (Dec. 1990) 644\u2013654. 10.1016\/0196-6774(90)90014-6","DOI":"10.1016\/0196-6774(90)90014-6"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"publisher","unstructured":"Marijn J.\u00a0H. Heule Manuel Kauers and Martina Seidl. 2019. Local Search for Fast Matrix Multiplication. arxiv:https:\/\/arXiv.org\/abs\/1903.1139110.48550\/arXiv.1903.11391","DOI":"10.48550\/arXiv.1903.11391"},{"key":"e_1_3_3_1_17_2","unstructured":"Keller Jordan. 2025. KellerJordan\/Muon. https:\/\/github.com\/KellerJordan\/Muon"},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"publisher","unstructured":"I.\u00a0E. Kaporin. 2024. Finding Complex-Valued Solutions of Brent Equations Using Nonlinear Least Squares. Computational Mathematics and Mathematical Physics 64 9 (Sept. 2024) 1881\u20131891. 10.1134\/S0965542524701021","DOI":"10.1134\/S0965542524701021"},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3597066.3597120"},{"key":"e_1_3_3_1_20_2","unstructured":"Manuel Kauers and Isaac Wood. 2025. Exploring the Meta Flip Graph for Matrix Multiplication. arxiv:https:\/\/arXiv.org\/abs\/2510.19787\u00a0[cs.SC] https:\/\/arxiv.org\/abs\/2510.19787"},{"key":"e_1_3_3_1_21_2","unstructured":"Kirill Khoruzhii Patrick Gel\u00df and Sebastian Pokutta. 2025. Flip graph search for structured matrix multiplication. https:\/\/github.com\/khoruzhii\/flip-cpd"},{"key":"e_1_3_3_1_22_2","unstructured":"Jakob Moosbauer. 2023. Search Techniques for Matrix Algorithms. Doctoral Thesis. Johannes Kepler University Linz."},{"key":"e_1_3_3_1_23_2","doi-asserted-by":"publisher","unstructured":"Jakob Moosbauer and Michael Poole. 2025. Flip Graphs with Symmetry and New Matrix Multiplication Schemes. arxiv:https:\/\/arXiv.org\/abs\/2502.0451410.48550\/arXiv.2502.04514","DOI":"10.48550\/arXiv.2502.04514"},{"key":"e_1_3_3_1_24_2","doi-asserted-by":"publisher","unstructured":"Alexander Novikov Ng\u00e2n V\u0169 Marvin Eisenberger Emilien Dupont Po-Sen Huang Adam\u00a0Zsolt Wagner Sergey Shirobokov Borislav Kozlovskii Francisco J.\u00a0R. Ruiz Abbas Mehrabian M.\u00a0Pawan Kumar Abigail See Swarat Chaudhuri George Holland Alex Davies Sebastian Nowozin Pushmeet Kohli and Matej Balog. 2025. AlphaEvolve: A Coding Agent for Scientific and Algorithmic Discovery. arxiv:https:\/\/arXiv.org\/abs\/2506.1313110.48550\/arXiv.2506.13131","DOI":"10.48550\/arXiv.2506.13131"},{"key":"e_1_3_3_1_25_2","doi-asserted-by":"publisher","unstructured":"V.\u00a0Ya. Pan. 1982. Trilinear Aggregating with Implicit Canceling for a New Acceleration of Matrix Multiplication. Computers & Mathematics with Applications 8 1 (Jan. 1982) 23\u201334. 10.1016\/0898-1221(82)90037-2","DOI":"10.1016\/0898-1221(82)90037-2"},{"key":"e_1_3_3_1_26_2","doi-asserted-by":"publisher","unstructured":"Dmitry Rybin Yushun Zhang and Zhi-Quan Luo. 2025. XXt Can Be Faster. arxiv:https:\/\/arXiv.org\/abs\/2505.0981410.48550\/arXiv.2505.09814","DOI":"10.48550\/arXiv.2505.09814"},{"key":"e_1_3_3_1_27_2","doi-asserted-by":"publisher","unstructured":"A. Sch\u00f6nhage. 1981. Partial and Total Matrix Multiplication. SIAM J. Comput. 10 3 (1981) 434\u2013455. arXiv:https:\/\/doi.org\/10.1137\/021003210.1137\/0210032","DOI":"10.1137\/0210032"},{"key":"e_1_3_3_1_28_2","doi-asserted-by":"publisher","unstructured":"Oded Schwartz and Eyal Zwecher. 2025. Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation. arxiv:https:\/\/arXiv.org\/abs\/2508.0174810.48550\/arXiv.2508.01748","DOI":"10.48550\/arXiv.2508.01748"},{"key":"e_1_3_3_1_29_2","doi-asserted-by":"publisher","unstructured":"A.\u00a0V. Smirnov. 2013. The Bilinear Complexity and Practical Algorithms for Matrix Multiplication. Computational Mathematics and Mathematical Physics 53 12 (Dec. 2013) 1781\u20131795. 10.1134\/S0965542513120129","DOI":"10.1134\/S0965542513120129"},{"key":"e_1_3_3_1_30_2","doi-asserted-by":"publisher","unstructured":"Volker Strassen. 1969. Gaussian Elimination Is Not Optimal. Numer. Math. 13 4 (Aug. 1969) 354\u2013356. 10.1007\/BF02165411","DOI":"10.1007\/BF02165411"},{"key":"e_1_3_3_1_31_2","volume-title":"Advances in Neural Information Processing Systems","author":"Vaswani Ashish","year":"2017","unstructured":"Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan\u00a0N Gomez, \u0141\u00a0ukasz Kaiser, and Illia Polosukhin. 2017. Attention is All you Need. In Advances in Neural Information Processing Systems , I.\u00a0Guyon, U.\u00a0Von Luxburg, S.\u00a0Bengio, H.\u00a0Wallach, R.\u00a0Fergus, S.\u00a0Vishwanathan, and R.\u00a0Garnett (Eds.), Vol.\u00a030. Curran Associates, Inc.https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2017\/file\/3f5ee243547dee91fbd053c1c4a845aa-Paper.pdf"},{"key":"e_1_3_3_1_32_2","doi-asserted-by":"publisher","unstructured":"Nikhil Vyas Depen Morwani Rosie Zhao Mujin Kwun Itai Shapira David Brandfonbrener Lucas Janson and Sham Kakade. 2025. SOAP: Improving and Stabilizing Shampoo Using Adam. arxiv:https:\/\/arXiv.org\/abs\/2409.1132110.48550\/arXiv.2409.11321","DOI":"10.48550\/arXiv.2409.11321"},{"key":"e_1_3_3_1_33_2","doi-asserted-by":"publisher","unstructured":"Isaac Wood. 2025. Exploring Commutative Matrix Multiplication Schemes via Flip Graphs. arxiv:https:\/\/arXiv.org\/abs\/2506.2211310.48550\/arXiv.2506.22113","DOI":"10.48550\/arXiv.2506.22113"},{"key":"e_1_3_3_1_34_2","doi-asserted-by":"publisher","unstructured":"Ke Ye and Lek-Heng Lim. 2016. Fast Structured Matrix Computations: Tensor Rank and Cohn\u2013Umans Method. arxiv:https:\/\/arXiv.org\/abs\/1601.0029210.48550\/arXiv.1601.00292","DOI":"10.48550\/arXiv.1601.00292"},{"key":"e_1_3_3_1_35_2","doi-asserted-by":"publisher","unstructured":"Ke Ye and Lek-Heng Lim. 2018. Fast Structured Matrix Computations. Foundations of Computational Mathematics 18 1 (Feb. 2018) 45\u201395. 10.1007\/s10208-016-9332-x","DOI":"10.1007\/s10208-016-9332-x"}],"event":{"name":"ISSAC '26: 51st International Symposium on Symbolic and Algebraic Computation","location":"Oldenburg , Germany","acronym":"ISSAC '26"},"container-title":["Proceedings of the 2026 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"deposited":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T16:24:29Z","timestamp":1783614269000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3815436.3815455"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,12]]},"references-count":34,"alternative-id":["10.1145\/3815436.3815455","10.1145\/3815436"],"URL":"https:\/\/doi.org\/10.1145\/3815436.3815455","relation":{},"subject":[],"published":{"date-parts":[[2026,7,12]]},"assertion":[{"value":"2026-07-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}