{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:27:45Z","timestamp":1729636065474,"version":"3.28.0"},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1109\/ccc.2012.26","type":"proceedings-article","created":{"date-parts":[[2012,7,31]],"date-time":"2012-07-31T16:43:30Z","timestamp":1343753010000},"page":"214-223","source":"Crossref","is-referenced-by-count":9,"title":["On Sunflowers and Matrix Multiplication"],"prefix":"10.1109","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[]},{"given":"Amir","family":"Shpilka","sequence":"additional","affiliation":[]},{"given":"Christopher","family":"Umans","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"19","DOI":"10.1007\/978-3-662-04650-0"},{"key":"17","first-page":"253","article-title":"Tura?n type problems","volume":"166","author":"fu?redi","year":"1991","journal-title":"London Math Soc Lecture Note Ser"},{"doi-asserted-by":"publisher","key":"18","DOI":"10.1146\/annurev.cs.03.060188.001533"},{"doi-asserted-by":"publisher","key":"15","DOI":"10.1007\/BF02579174"},{"doi-asserted-by":"publisher","key":"16","DOI":"10.1016\/0097-3165(78)90060-2"},{"key":"13","first-page":"97","article-title":"Some unsolved problems in graph theory and combinatorial analysis","volume":"1971","author":"erdos","year":"0","journal-title":"Combinatorial Mathematics and Its Applications (Proc Conf Oxford 1969)"},{"key":"14","first-page":"403","article-title":"Problems and results on finite and infinite combinatorial analysis","volume":"10","author":"erdos","year":"1975","journal-title":"Am Math Soc Colloquium"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1112\/jlms\/s1-35.1.85"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1112\/jlms\/s1-44.1.467"},{"doi-asserted-by":"publisher","key":"21","DOI":"10.1016\/0097-3165(95)90024-1"},{"key":"20","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/978-3-642-60406-5_19","article-title":"A bound of the cardinality of families not containing ?-systems","volume":"14","author":"kostochka","year":"1997","journal-title":"Algorithms Combin"},{"key":"22","first-page":"798","article-title":"Lower bounds on the monotone complexity of some Boolean functions","volume":"281","author":"razborov","year":"1985","journal-title":"Dokl Akad Nauk SSSR"},{"doi-asserted-by":"publisher","key":"23","DOI":"10.1073\/pnas.28.12.561"},{"doi-asserted-by":"publisher","key":"24","DOI":"10.4153\/CMB-1977-038-7"},{"doi-asserted-by":"publisher","key":"25","DOI":"10.1007\/BF02165411"},{"key":"26","first-page":"406","article-title":"Relative bilinear complexity and matrix multiplication","volume":"375","author":"strassen","year":"1987","journal-title":"J reine angew Math"},{"year":"2010","author":"stothers","journal-title":"On the Complexity of Matrix Multiplication","key":"27"},{"year":"2011","author":"vassilevska williams","journal-title":"Breaking the Coppersmith-Winograd Barrier","key":"28"},{"key":"3","article-title":"On the factorization of the complete uniform hypergraph","volume":"10","author":"baranyai","year":"1975","journal-title":"Colloq Math Soc J Bolyai"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1007\/BF02809902"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1023\/A:1027365901231"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1007\/BF02579196"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1109\/SFCS.2003.1238217"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1109\/SFCS.2005.39"},{"key":"5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03338-8","author":"bu?rgisser","year":"1997","journal-title":"Algebraic Complexity Theory"},{"year":"2011","author":"batemand","journal-title":"New Bounds on Cap Sets","key":"4"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1006\/jcta.1997.2778"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1016\/S0747-7171(08)80013-2"}],"event":{"name":"2012 IEEE Conference on Computational Complexity (CCC)","start":{"date-parts":[[2012,6,26]]},"location":"Porto, Portugal","end":{"date-parts":[[2012,6,29]]}},"container-title":["2012 IEEE 27th Conference on Computational Complexity"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6242817\/6243364\/06243397.pdf?arnumber=6243397","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T18:15:39Z","timestamp":1497982539000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6243397\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/ccc.2012.26","relation":{},"subject":[],"published":{"date-parts":[[2012,6]]}}}