{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:51:58Z","timestamp":1776847918853,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214056","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"887-898","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":394,"title":["Multiplying matrices faster than coppersmith-winograd"],"prefix":"10.1145","author":[{"given":"Virginia Vassilevska","family":"Williams","sequence":"first","affiliation":[{"name":"UC Berkeley \/ Stanford University, Berkeley \/ Stanford, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Addison-Wesley Longman Publishing Co.","author":"Aho A. V.","year":"1974"},{"key":"e_1_3_2_2_2_1","first-page":"18","article-title":"On sunflowers and matrix multiplication","volume":"11","author":"Alon N.","year":"2011","journal-title":"ECCC TR"},{"key":"e_1_3_2_2_3_1","first-page":"331","volume-title":"Proc. Nat. Acad. Sci.","author":"Behrend F. A.","year":"1946"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90113-3"},{"key":"e_1_3_2_2_5_1","unstructured":"M. Blaser. Complexity of bilinear problems (lecture notes scribed by F. Endun). http:\/\/www-cc.cs.uni-saarland.de\/teaching\/SS09\/ComplexityofBilinearProblems\/script.pdf 2009.  M. Blaser. Complexity of bilinear problems (lecture notes scribed by F. Endun). http:\/\/www-cc.cs.uni-saarland.de\/teaching\/SS09\/ComplexityofBilinearProblems\/script.pdf 2009."},{"key":"e_1_3_2_2_6_1","volume-title":"Springer-Verlag","author":"B\u00fcrgisser P.","year":"1996"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.39"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946301"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1981.27"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-35.1.85"},{"key":"e_1_3_2_2_12_1","unstructured":"F. Le Gall. Personal communication.  F. Le Gall. Personal communication."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780574"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.34"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0211020"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.28.12.561"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0210032"},{"key":"e_1_3_2_2_18_1","unstructured":"A. Stothers. Ph.D. Thesis U. Edinburgh 2010.  A. Stothers. Ph.D. Thesis U. Edinburgh 2010."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"V. Strassen. Relative bilinear complexity and matrix multiplication. J. reine angew. Math. (Crelles Journal) 375--376:406--443 1987.  V. Strassen. Relative bilinear complexity and matrix multiplication. J. reine angew. Math. (Crelles Journal) 375--376:406--443 1987.","DOI":"10.1515\/crll.1987.375-376.406"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(75)80046-8"}],"event":{"name":"STOC'12: Symposium on Theory of Computing","location":"New York New York USA","acronym":"STOC'12","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214056","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214056","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:54Z","timestamp":1750238454000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":21,"alternative-id":["10.1145\/2213977.2214056","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214056","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}