{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T23:05:38Z","timestamp":1791068738313,"version":"4.1.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,3,12]],"date-time":"2013-03-12T00:00:00Z","timestamp":1363046400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["comput. complex."],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s00037-013-0060-1","type":"journal-article","created":{"date-parts":[[2013,3,11]],"date-time":"2013-03-11T07:07:45Z","timestamp":1362985665000},"page":"219-243","source":"Crossref","is-referenced-by-count":31,"title":["On sunflowers and matrix multiplication"],"prefix":"10.1007","volume":"22","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amir","family":"Shpilka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christopher","family":"Umans","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,3,12]]},"reference":[{"issue":"1","key":"60_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579196","volume":"7","author":"N. Alon","year":"1987","unstructured":"Alon N., Boppana R.B (1987) The monotone circuit complexity of Boolean functions. Combinatorica 7(1): 1\u201322","journal-title":"Combinatorica"},{"key":"60_CR2","unstructured":"Zs. Baranyai (1975). On the factorization of the complete uniform hypergraph. In Infinite and finite sets, Proc. Coll. Keszthely, 1973, (A. Hajnal, R. Rado and V.T. S\u00f3s, eds.), Colloquia Math. Soc. J\u00e1nos Bolyai 10. North-Holland."},{"issue":"2","key":"60_CR3","first-page":"585","volume":"25","author":"M. Bateman","year":"2012","unstructured":"Bateman M., Katz N.H (2012) New bounds on cap sets. J. of the AMS 25(2): 585\u2013613","journal-title":"J. of the AMS"},{"key":"60_CR4","doi-asserted-by":"crossref","unstructured":"P. B\u00fcrgisser, M. Clausen & M. A. Shokrollahi (1997). Algebraic Complexity Theory. Springer.","DOI":"10.1007\/978-3-662-03338-8"},{"key":"60_CR5","doi-asserted-by":"crossref","unstructured":"H. Cohn, R. D. Kleinberg, B. Szegedy & C. Umans (2005). Group-theoretic Algorithms for Matrix Multiplication. In Proceedings of the 46th Annual FOCS, 379\u2013388.","DOI":"10.1109\/SFCS.2005.39"},{"key":"60_CR6","unstructured":"H. Cohn & C. Umans (2003). A Group-theoretic Approach to Fast Matrix Multiplication. In Proceedings of the 44th Annual FOCS, 438\u2013449."},{"key":"60_CR7","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"D. Coppersmith & S. Winograd (1990). Matrix multiplication via arithmetic progression. J. of Symbolic Computation 9, 251\u2013280.","journal-title":"J. of Symbolic Computation"},{"key":"60_CR8","doi-asserted-by":"crossref","unstructured":"W. A. Deuber, P. Erd\u00f6s, D. S. Gunderson, A. V. Kostochka & A. G. Meyer (1997). Intersection Statements for Systems of Sets. J. Comb. Theory, Ser. A 79(1), 118\u2013132.","DOI":"10.1006\/jcta.1997.2778"},{"key":"60_CR9","doi-asserted-by":"crossref","unstructured":"Y. Edel (2004). Extensions of generalized product caps 31(1), 5\u201314.","DOI":"10.1023\/A:1027365901231"},{"key":"60_CR10","unstructured":"P. Erd\u0151s (1971). Some unsolved problems in graph theory and com binatorial analysis. In Combinatorial Mathematics and its Applications (Proc. Conf., Oxford, 1969), 97\u2013109. Academic Press, London."},{"key":"60_CR11","unstructured":"P. Erd\u0151s (1975). Problems and results on finite and infinite combi natorial analysis. In Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erd\u00f6s on his 60th birthday) Vol. I; Colloq. Math. Soc., J\u00e1nos Bolyai, editor, volume 10, 403\u2013424. North-Holland, Amster717 dam."},{"key":"60_CR12","doi-asserted-by":"crossref","unstructured":"P. Erd\u0151s (1981). On the combinatorial problems which I would most like to see solved. Combinatorica 1(1), 25\u201342.","DOI":"10.1007\/BF02579174"},{"key":"60_CR13","doi-asserted-by":"crossref","unstructured":"P. Erd\u0151s & R. Rado (1960). Intersection theorems for systems of sets. J. London Math. Soc. 35, 85\u201390.","DOI":"10.1112\/jlms\/s1-35.1.85"},{"key":"60_CR14","doi-asserted-by":"crossref","unstructured":"P. Erd\u0151s & R. Rado (1969). Intersection theorems for systems of sets II. J. London Math. Soc. 44, 467\u2013479.","DOI":"10.1112\/jlms\/s1-44.1.467"},{"key":"60_CR15","doi-asserted-by":"crossref","unstructured":"P. Erd\u0151s & E. Szemer\u00e9di (1978). Combinatorial properties of sys tems of sets. J. Combinatorial Theory Ser. A 24(3), 308\u2013313.","DOI":"10.1016\/0097-3165(78)90060-2"},{"key":"60_CR16","doi-asserted-by":"crossref","unstructured":"Z. F\u00fcredi (1991). Tur\u00e1n type problems. Surveys in combinatorics, London Math. Soc. Lecture Note Ser. 166, 253\u2013300. Cambridge Univ. Press.","DOI":"10.1017\/CBO9780511666216.010"},{"key":"60_CR17","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1146\/annurev.cs.03.060188.001533","volume":"3","author":"J zur Gathen von","year":"1988","unstructured":"J. von zur Gathen (1988). Algebraic Complexity Theory. Annual review of computer science 3, 317\u2013347.","journal-title":"Annual review of computer science"},{"key":"60_CR18","doi-asserted-by":"crossref","unstructured":"S. Jukna (2001). Extremal Combinatorics. Springer.","DOI":"10.1007\/978-3-662-04650-0"},{"key":"60_CR19","doi-asserted-by":"crossref","unstructured":"A. V. Kostochka (1997). A bound of the cardinality of families not containing \u0394-systems. In The mathematics of Paul Erd\u0151s, II, Algo rithms Combin., volume 14, 229\u2013235. Springer.","DOI":"10.1007\/978-3-642-60406-5_19"},{"key":"60_CR20","doi-asserted-by":"crossref","unstructured":"R. Meshulam (1995). On Subsets of Finite Abelian Groups with No 3-Term Arithmetic Progressions. J. Comb. Theory, Ser. A 71(1), 168\u2013172.","DOI":"10.1016\/0097-3165(95)90024-1"},{"key":"60_CR21","unstructured":"A. A. Razborov (1985). Lower bounds on the monotone complexity of some Boolean functions. Dokl. Akad. Nauk. SSSR 281(4), 798\u2013801. In Russian."},{"key":"60_CR22","unstructured":"R. Salem & D. Spencer (1942). On sets of integers which contain no three in arithmetic progression. Proc. Nat. Acad. Sci. (USA) 28, 561."},{"issue":"2","key":"60_CR23","doi-asserted-by":"crossref","first-page":"249","DOI":"10.4153\/CMB-1977-038-7","volume":"20","author":"J Spencer","year":"1977","unstructured":"J. Spencer (1977). Intersection Theorems for Systems of Sets. Canadian Math Bulletin 20(2), 249\u2013254.","journal-title":"Canadian Math Bulletin"},{"key":"60_CR24","unstructured":"A. Stothers (2010). On the complexity of matrix multiplication. Ph.D. thesis, U. Edinburgh."},{"key":"60_CR25","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V Strassen","year":"1969","unstructured":"Strassen V (1969) Gaussian elimination is not optimal. Numer. Math 13: 354\u2013356","journal-title":"Numer. Math"},{"key":"60_CR26","unstructured":"V. Strassen (1987). Relative bilinear complexity and matrix multi plication.J. Reine Angew. Math. 375\/376, 406\u2013443."},{"key":"60_CR27","doi-asserted-by":"crossref","unstructured":"V. Vassilevska Williams (2012). Multiplying matrices faster than Coppersmith-Winograd. In Proceedings of the 44th annual STOC, 887\u2013898.","DOI":"10.1145\/2213977.2214056"}],"container-title":["computational complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-013-0060-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00037-013-0060-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-013-0060-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T19:50:26Z","timestamp":1562788226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00037-013-0060-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,12]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["60"],"URL":"https:\/\/doi.org\/10.1007\/s00037-013-0060-1","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,12]]}}}