{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T18:05:04Z","timestamp":1746295504944,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031196843"},{"type":"electronic","value":"9783031196850"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-19685-0_11","type":"book-chapter","created":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T15:04:53Z","timestamp":1666019093000},"page":"149-160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Normal Form for\u00a0Matrix Multiplication Schemes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8641-6661","authenticated-orcid":false,"given":"Manuel","family":"Kauers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0634-4854","authenticated-orcid":false,"given":"Jakob","family":"Moosbauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,18]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Alman, J., Williams, V.V.: A refined laser method and faster matrix multiplication. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 522\u2013539 (2021). https:\/\/doi.org\/10.1137\/1.9781611976465.32","DOI":"10.1137\/1.9781611976465.32"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Berger, G.O., Absil, P.A., De Lathauwer, L., Jungers, R.M., Van Barel, M.: Equivalent polyadic decompositions of matrix multiplication tensors. J. Comput. Appl. Math. 406, 17, Paper no. 113941 (2022). https:\/\/doi.org\/10.1016\/j.cam.2021.113941","DOI":"10.1016\/j.cam.2021.113941"},{"issue":"1","key":"11_CR3","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0885-064X(02)00007-9","volume":"19","author":"M Bl\u00e4ser","year":"2003","unstructured":"Bl\u00e4ser, M.: On the complexity of the multiplication of matrices of small formats. J. Complex. 19(1), 43\u201360 (2003). https:\/\/doi.org\/10.1016\/S0885-064X(02)00007-9","journal-title":"J. Complex."},{"key":"11_CR4","volume-title":"Algebraic Complexity Theory","author":"P B\u00fcrgisser","year":"2013","unstructured":"B\u00fcrgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic Complexity Theory, vol. 315. Springer, Heidelberg (2013)"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Courtois, N.T., Bard, G.V., Hulme, D.: A new general-purpose method to multiply $$3\\times 3$$ matrices using only 23 multiplications (2011). https:\/\/doi.org\/10.48550\/ARXIV.1108.2830","DOI":"10.48550\/ARXIV.1108.2830"},{"issue":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0304-3975(78)90045-2","volume":"7","author":"HF de Groote","year":"1978","unstructured":"de Groote, H.F.: On varieties of optimal algorithms for the computation of bilinear mappings ii. optimal algorithms for $$2\\times 2$$-matrix multiplication. Theor. Comput. Sci. 7(2), 127\u2013148 (1978). https:\/\/doi.org\/10.1016\/0304-3975(78)90045-2","journal-title":"Theor. Comput. Sci."},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1016\/j.jsc.2020.10.003","volume":"104","author":"MJH Heule","year":"2021","unstructured":"Heule, M.J.H., Kauers, M., Seidl, M.: New ways to multiply $$3\\times 3$$-matrices. J. Symbolic Comput. 104, 899\u2013916 (2021). https:\/\/doi.org\/10.1016\/j.jsc.2020.10.003","journal-title":"J. Symbolic Comput."},{"issue":"2","key":"11_CR8","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1137\/0215043","volume":"15","author":"RW Johnson","year":"1986","unstructured":"Johnson, R.W., McLoughlin, A.M.: Noncommutative bilinear algorithms for $$3\\times 3$$ matrix multiplication. SIAM J. Comput. 15(2), 595\u2013603 (1986). https:\/\/doi.org\/10.1137\/0215043","journal-title":"SIAM J. Comput."},{"issue":"1","key":"11_CR9","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1090\/S0002-9904-1976-13988-2","volume":"82","author":"JD Laderman","year":"1976","unstructured":"Laderman, J.D.: A noncommutative algorithm for multiplying $$3\\times 3$$ matrices using $$23$$ multiplications. Bull. Am. Math. Soc. 82(1), 126\u2013128 (1976). https:\/\/doi.org\/10.1090\/S0002-9904-1976-13988-2","journal-title":"Bull. Am. Math. Soc."},{"issue":"17","key":"11_CR10","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1016\/j.ipl.2013.05.011","volume":"113","author":"J Oh","year":"2013","unstructured":"Oh, J., Kim, J., Moon, B.R.: On the inequivalence of bilinear algorithms for $$3\\times 3$$ matrix multiplication. Inf. Process. Lett. 113(17), 640\u2013645 (2013). https:\/\/doi.org\/10.1016\/j.ipl.2013.05.011","journal-title":"Inf. Process. Lett."},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Rosowski, A.: Fast commutative matrix algorithm (2019). https:\/\/doi.org\/10.48550\/ARXIV.1904.07683","DOI":"10.48550\/ARXIV.1904.07683"},{"issue":"12","key":"11_CR12","doi-asserted-by":"publisher","first-page":"1781","DOI":"10.1134\/S0965542513120129","volume":"53","author":"AV Smirnov","year":"2013","unstructured":"Smirnov, A.V.: The bilinear complexity and practical algorithms for matrix multiplication. Comput. Math. Math. Phys. 53(12), 1781\u20131795 (2013). https:\/\/doi.org\/10.1134\/S0965542513120129","journal-title":"Comput. Math. Math. Phys."},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V Strassen","year":"1969","unstructured":"Strassen, V.: Gaussian elimination is not optimal. Numer. Math. 13, 354\u2013356 (1969). https:\/\/doi.org\/10.1007\/BF02165411","journal-title":"Numer. Math."},{"issue":"4","key":"11_CR14","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/0024-3795(71)90009-7","volume":"4","author":"S Winograd","year":"1971","unstructured":"Winograd, S.: On multiplication of $$2\\times 2$$ matrices. Linear Algebra Appl. 4(4), 381\u2013388 (1971). https:\/\/doi.org\/10.1016\/0024-3795(71)90009-7","journal-title":"Linear Algebra Appl."}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19685-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T15:07:41Z","timestamp":1666019261000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19685-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031196843","9783031196850"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19685-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"18 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algebraic Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cai2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cai2022.math.auth.gr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The volume consist of 2 abstracts, 3 full papers of invited speakers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}