{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:38:41Z","timestamp":1743035921214,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491924"},{"type":"electronic","value":"9783031491931"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-49193-1_4","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"41-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficiently-Verifiable Strong Uniquely Solvable Puzzles and Matrix Multiplication"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Anderson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vu","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Alman, J., Williams, V.V.: Further limitations of the known approaches for matrix multiplication. In: 9th Innovations in Theoretical Computer Science (ITCS). LIPIcs. Leibniz International Proceedings in Informatics, vol. 94, pp. Art. No. 25, 15. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, Germany (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2018.25","DOI":"10.4230\/LIPIcs.ITCS.2018.25"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Alman, J., Williams, V.V.: A Refined Laser Method and Faster Matrix Multiplication, pp. 522\u2013539. SIAM (2020). https:\/\/doi.org\/10.1137\/1.9781611976465.32","DOI":"10.1137\/1.9781611976465.32"},{"issue":"2","key":"4_CR3","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00037-013-0060-1","volume":"22","author":"N Alon","year":"2013","unstructured":"Alon, N., Shpilka, A., Umans, C.: On sunflowers and matrix multiplication. Comput. Complex. 22(2), 219\u2013243 (2013). https:\/\/doi.org\/10.1007\/s00037-013-0060-1","journal-title":"Comput. Complex."},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-030-51825-7_32","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2020","author":"M Anderson","year":"2020","unstructured":"Anderson, M., Ji, Z., Xu, A.Y.: Matrix multiplication: verifying strong uniquely solvable puzzles. In: Pulina, L., Seidl, M. (eds.) SAT 2020. LNCS, vol. 12178, pp. 464\u2013480. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51825-7_32"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Anderson, M., Ji, Z., Xu, A.Y.: Matrix multiplication: verifying strong uniquely solvable puzzles (2023). https:\/\/doi.org\/10.48550\/ARXIV.2301.00074","DOI":"10.48550\/ARXIV.2301.00074"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Anderson, M., Le, V.: Efficiently-verifiable strong uniquely solvable puzzles and matrix multiplication (2023). https:\/\/doi.org\/10.48550\/ARXIV.2307.06463","DOI":"10.48550\/ARXIV.2307.06463"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Blasiak, J., et al.: Which groups are amenable to proving exponent two for matrix multiplication? (2017). https:\/\/doi.org\/10.48550\/ARXIV.1712.02302","DOI":"10.48550\/ARXIV.1712.02302"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Cohn, H., Kleinberg, R., Szegedy, B., Umans, C.: Group-theoretic algorithms for matrix multiplication. In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 379\u2013388 (2005). https:\/\/doi.org\/10.1109\/SFCS.2005.39","DOI":"10.1109\/SFCS.2005.39"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Cohn, H., Umans, C.: A group-theoretic approach to fast matrix multiplication. In: 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 438\u2013449 (2003). https:\/\/doi.org\/10.1109\/SFCS.2003.1238217","DOI":"10.1109\/SFCS.2003.1238217"},{"issue":"3","key":"4_CR10","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symb. Comput. 9(3), 251\u2013280 (1990). https:\/\/doi.org\/10.1016\/S0747-7171(08)80013-2","journal-title":"J. Symb. Comput."},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Croot, E., Lev, V.F., Pach, P.P.: Progression-free sets in are exponentially small. Ann. Math. 331\u2013337 (2017). https:\/\/doi.org\/10.4007\/annals.2017.185.1.7","DOI":"10.4007\/annals.2017.185.1.7"},{"issue":"2","key":"4_CR12","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1017\/S0308210511001648","volume":"143","author":"AM Davie","year":"2013","unstructured":"Davie, A.M., Stothers, A.J.: Improved bound for complexity of matrix multiplication. Proc. R. Soc. Edinb. Sect. A: Math. 143(2), 351\u2013369 (2013)","journal-title":"Proc. R. Soc. Edinb. Sect. A: Math."},{"key":"4_CR13","doi-asserted-by":"publisher","unstructured":"Duan, R., Wu, H., Zhou, R.: Faster matrix multiplication via asymmetric hashing (2022). https:\/\/doi.org\/10.48550\/ARXIV.2210.10173","DOI":"10.48550\/ARXIV.2210.10173"},{"issue":"7930","key":"4_CR14","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1038\/s41586-022-05172-4","volume":"610","author":"A Fawzi","year":"2022","unstructured":"Fawzi, A., et al.: Discovering faster matrix multiplication algorithms with reinforcement learning. Nature 610(7930), 47\u201353 (2022). https:\/\/doi.org\/10.1038\/s41586-022-05172-4","journal-title":"Nature"},{"key":"4_CR15","volume-title":"Artificial Intelligence: A Modern Approach","author":"S Russell","year":"2020","unstructured":"Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach. Pearson, London (2020)"},{"issue":"4","key":"4_CR16","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). https:\/\/doi.org\/10.1007\/BF02165411","journal-title":"Numer. Math."},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.tcs.2011.12.071","volume":"423","author":"T Tassa","year":"2012","unstructured":"Tassa, T.: Finding all maximally-matchable edges in a bipartite graph. Theoret. Comput. Sci. 423, 50\u201358 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2011.12.071","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49193-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:03:17Z","timestamp":1702026197000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49193-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491924","9783031491931"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49193-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawaii, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","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":"60","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":"41% - 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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}