{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T13:45:25Z","timestamp":1762782325307,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030242572"},{"type":"electronic","value":"9783030242589"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-24258-9_10","type":"book-chapter","created":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T17:02:31Z","timestamp":1561741351000},"page":"155-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Local Search for Fast Matrix Multiplication"],"prefix":"10.1007","author":[{"given":"Marijn J. H.","family":"Heule","sequence":"first","affiliation":[]},{"given":"Manuel","family":"Kauers","sequence":"additional","affiliation":[]},{"given":"Martina","family":"Seidl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,29]]},"reference":[{"key":"10_CR1","unstructured":"Biere, A.: CaDiCaL, Lingeling, Plingeling, Treengeling and YalSAT entering the SAT competition 2018. In: Proceedings of the SAT Competition 2018 \u2013 Solver and Benchmark Descriptions. Department of Computer Science Series of Publications B, vol. B-2018-1, pp. 13\u201314. University of Helsinki (2018)"},{"issue":"1","key":"10_CR2","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)","journal-title":"J. Complex."},{"key":"10_CR3","unstructured":"Bl\u00e4ser, M.: Fast Matrix Multiplication. Number 5 in Graduate Surveys. Theory of Computing Library (2013)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Brent, R.P.: Algorithms for matrix multiplication. Technical report, Department of Computer Science, Stanford (1970)","DOI":"10.21236\/AD0705509"},{"key":"10_CR5","unstructured":"B\u00fcrgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic Complexity Theory, vol. 315. Springer, Heidelberg (2013)"},{"key":"10_CR6","unstructured":"Courtois, N., Bard, G.V., Hulme, D.: A new general-purpose method to multiply \n                    \n                      \n                    \n                    $$3\\times 3$$\n                   matrices using only 23 multiplications. CoRR, abs\/1108.2830 (2011)"},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(78)90038-5","volume":"7","author":"HF Groote de","year":"1978","unstructured":"de Groote, H.F.: On varieties of optimal algorithms for the computation of bilinear mappings I. The isotropy group of a bilinear mapping. Theor. Comput. Sci. 7(1), 1\u201324 (1978)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-540-30201-8_22","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"C Gomes","year":"2004","unstructured":"Gomes, C., Sellmann, M.: Streamlined constraint reasoning. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 274\u2013289. Springer, Heidelberg (2004)"},{"key":"10_CR9","unstructured":"Heule, M.J.H., Kauers, M., Seidl, M.: New ways to multiply \n                    \n                      \n                    \n                    $$3\\times 3$$\n                   matrices (in preparation)"},{"issue":"1","key":"10_CR10","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 \n                    \n                      \n                    \n                    $$3\\times 3$$\n                   matrices using 23 multiplications. Bull. Am. Math. Soc. 82(1), 126\u2013128 (1976)","journal-title":"Bull. Am. Math. Soc."},{"key":"10_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/9781108183192","volume-title":"Geometry and Complexity Theory","author":"JM Landsberg","year":"2017","unstructured":"Landsberg, J.M.: Geometry and Complexity Theory, vol. 169. Cambridge University Press, Cambridge (2017)"},{"issue":"17","key":"10_CR12","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 \n                    \n                      \n                    \n                    $$3\\times 3$$\n                   matrix multiplication. Inf. Process. Lett. 113(17), 640\u2013645 (2013)","journal-title":"Inf. Process. Lett."},{"key":"10_CR13","unstructured":"Pan, V.Y.: Fast feasible and unfeasible matrix multiplication. CoRR, abs\/1804.04102 (2018)"},{"issue":"12","key":"10_CR14","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)","journal-title":"Comput. Math. Math. Phys."},{"issue":"4","key":"10_CR15","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(4), 354\u2013356 (1969)","journal-title":"Numer. Math."},{"issue":"4","key":"10_CR16","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 \n                    \n                      \n                    \n                    $$2\\times 2$$\n                   matrices. Linear Algebra Appl. 4(4), 381\u2013388 (1971)","journal-title":"Linear Algebra Appl."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2019"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24258-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,31]],"date-time":"2019-07-31T13:05:10Z","timestamp":1564578310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-24258-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030242572","9783030242589"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24258-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"29 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Satisfiability Testing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sat2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sat2019.tecnico.ulisboa.pt\/","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":"64","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":"19","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":"7","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":"30% - 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","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":"6","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)"}}]}}