{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T11:44:26Z","timestamp":1762775066594,"version":"build-2065373602"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,28]]},"DOI":"10.1145\/3747199.3747555","type":"proceedings-article","created":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T10:51:17Z","timestamp":1762771877000},"page":"132-139","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Faster search for tensor decomposition over finite fields"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-6619-7167","authenticated-orcid":false,"given":"Jason","family":"Yang","sequence":"first","affiliation":[{"name":"Computer Science, Massachusetts Institute of Technology, Cambridge, MA, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,11,10]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"crossref","unstructured":"Valery\u00a0B. Alekseyev. 1985. On the complexity of some algorithms of matrix multiplication. Journal of Algorithms 6 1 (1985) 71\u201385.","DOI":"10.1016\/0196-6774(85)90019-7"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.63"},{"key":"e_1_3_3_2_4_2","unstructured":"Josh Alman Ethan Turok Hantao Yu and Hengzhi Zhang. 2023. Tensors Ranks and the Fine-Grained Complexity of Dynamic Programming. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2309.04683 (2023)."},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.61"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00090"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3666000.3669701"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"crossref","unstructured":"Markus Bl\u00e4ser. 2003. On the complexity of the multiplication of matrices of small formats. Journal of Complexity 19 1 (2003) 43\u201360.","DOI":"10.1016\/S0885-064X(02)00007-9"},{"key":"e_1_3_3_2_9_2","unstructured":"Markus Bl\u00e4ser. 2013. Fast matrix multiplication. Theory of Computing (2013) 1\u201360."},{"key":"e_1_3_3_2_10_2","unstructured":"Nicolas\u00a0T Courtois Gregory\u00a0V Bard and Daniel Hulme. 2011. A new general-purpose method to multiply 3x3 matrices using only 23 multiplications. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/1108.2830 (2011)."},{"key":"e_1_3_3_2_11_2","unstructured":"Arnaud Deza Chang Liu Pashootan Vaezipoor and Elias\u00a0B Khalil. 2023. Fast Matrix Multiplication Without Tears: A Constraint Programming Approach. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2306.01097 (2023)."},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"crossref","unstructured":"Alhussein Fawzi Matej Balog Aja Huang Thomas Hubert Bernardino Romera-Paredes Mohammadamin Barekatain Alexander Novikov Francisco\u00a0J R\u00a0Ruiz Julian Schrittwieser Grzegorz Swirszcz et\u00a0al. 2022. Discovering faster matrix multiplication algorithms with reinforcement learning. Nature 610 7930 (2022) 47\u201353.","DOI":"10.1038\/s41586-022-05172-4"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"crossref","unstructured":"Johan H\u00e5stad. 1990. Tensor rank is NP-complete. Journal of Algorithms 11 4 (1990) 644\u2013654.","DOI":"10.1016\/0196-6774(90)90014-6"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-24258-9_10"},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"crossref","unstructured":"John\u00a0E Hopcroft and Leslie\u00a0R Kerr. 1971. On minimizing the number of multiplications necessary for matrix multiplication. SIAM J. Appl. Math. 20 1 (1971) 30\u201336.","DOI":"10.1137\/0120004"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3597066.3597120"},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"crossref","unstructured":"Manuel Kauers and Jakob Moosbauer. 2025. Some new non-commutative matrix multiplication algorithms of size (n m 6). ACM Communications in Computer Algebra 58 1 (2025) 1\u201311.","DOI":"10.1145\/3712020.3712021"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"crossref","unstructured":"Julian\u00a0D Laderman. 1976. A noncommutative algorithm for multiplying 3*3 matrices using 23 multiplications. (1976).","DOI":"10.1090\/S0002-9904-1976-13988-2"},{"key":"e_1_3_3_2_19_2","unstructured":"Vladimir Lysikov. 2024. Tensor rank and substitution method. https:\/\/qi.rub.de\/files\/courses\/tensors_ss24\/20240425-Lysikov-TensorRank-Substitution.pdf (2024)."},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.34"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"crossref","unstructured":"V\u00a0Ya Pan. 1982. Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication. Computers & Mathematics with Applications 8 1 (1982) 23\u201334.","DOI":"10.1016\/0898-1221(82)90037-2"},{"key":"e_1_3_3_2_22_2","unstructured":"Alexandre Sedoglavic. 2019. Yet another catalogue of fast matrix multiplication algorithms. https:\/\/fmm.univ-lille.fr\/index.html (2019)."},{"key":"e_1_3_3_2_23_2","unstructured":"Yaroslav Shitov. 2016. How hard is the tensor rank? arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/1611.01559 (2016)."},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"crossref","unstructured":"Alexey\u00a0V Smirnov. 2013. The bilinear complexity and practical algorithms for matrix multiplication. Computational Mathematics and Mathematical Physics 53 (2013) 1781\u20131795.","DOI":"10.1134\/S0965542513120129"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"crossref","unstructured":"Volker Strassen. 1969. Gaussian elimination is not optimal. Numerische mathematik 13 4 (1969) 354\u2013356.","DOI":"10.1007\/BF02165411"},{"key":"e_1_3_3_2_26_2","unstructured":"Jason Yang. 2024. Depth-first search for tensor rank and border rank over finite fields. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2411.14676 (2024)."}],"event":{"name":"ISSAC '25: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Guanajuato Mexico","acronym":"ISSAC '25"},"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.3747555","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T11:39:43Z","timestamp":1762774783000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3747199.3747555"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,28]]},"references-count":25,"alternative-id":["10.1145\/3747199.3747555","10.1145\/3747199"],"URL":"https:\/\/doi.org\/10.1145\/3747199.3747555","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"}}]}}