On sunflowers and matrix multiplication

Computational Complexity

Volumn 22, Issue 2, 2013, Pages 219-243

  Alon, Noga ^a,b   Shpilka, Amir ^c   Umans, Christopher ^d  

^a TEL AVIV UNIVERSITY   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d California Institute of Technology   (United States)

Author keywords

matrix multiplication; sunflowers

Indexed keywords

EID: 84877925335     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-013-0060-1     Document Type: Article

References (27)

1. Alon N., Boppana R. B (1987) The monotone circuit complexity of Boolean functions. Combinatorica 7(1): 1-22.
2. 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ós, eds.), Colloquia Math. Soc. János Bolyai 10. North-Holland.
3. Bateman M., Katz N. H (2012) New bounds on cap sets. J. of the AMS 25(2): 585-613.
4. P. Bürgisser, M. Clausen & M. A. Shokrollahi (1997). Algebraic Complexity Theory. Springer.
5. H. Cohn, R. D. Kleinberg, B. Szegedy & C. Umans (2005). Group-theoretic Algorithms for Matrix Multiplication. In Proceedings of the 46th Annual FOCS, 379-388.
6. H. Cohn & C. Umans (2003). A Group-theoretic Approach to Fast Matrix Multiplication. In Proceedings of the 44th Annual FOCS, 438-449.
7. D. Coppersmith & S. Winograd (1990). Matrix multiplication via arithmetic progression. J. of Symbolic Computation 9, 251-280.
8. W. A. Deuber, P. Erdös, D. S. Gunderson, A. V. Kostochka & A. G. Meyer (1997). Intersection Statements for Systems of Sets. J. Comb. Theory, Ser. A 79(1), 118-132.
9. Y. Edel (2004). Extensions of generalized product caps 31(1), 5-14.
10. P. Erdo{double acute}s (1971). Some unsolved problems in graph theory and com binatorial analysis. In Combinatorial Mathematics and its Applications (Proc. Conf., Oxford, 1969), 97-109. Academic Press, London.
11. P. Erdo{double acute}s (1975). Problems and results on finite and infinite combi natorial analysis. In Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdös on his 60th birthday) Vol. I; Colloq. Math. Soc., János Bolyai, editor, volume 10, 403-424. North-Holland, Amster717 dam.
12. P. Erdo{double acute}s (1981). On the combinatorial problems which I would most like to see solved. Combinatorica1(1), 25-42.
13. P. Erdo{double acute}s & R. Rado (1960). Intersection theorems for systems of sets. J. London Math. Soc. 35, 85-90.
14. P. Erdo{double acute}s & R. Rado (1969). Intersection theorems for systems of sets II. J. London Math. Soc. 44, 467-479.
15. P. Erdo{double acute}s & E. Szemerédi (1978). Combinatorial properties of sys tems of sets. J. Combinatorial Theory Ser. A 24(3), 308-313.
16. Z. Füredi (1991). Turán type problems. Surveys in combinatorics, London Math. Soc. Lecture Note Ser. 166, 253-300. Cambridge Univ. Press.
17. J. von zur Gathen (1988). Algebraic Complexity Theory. Annual review of computer science 3, 317-347.
18. S. Jukna (2001). Extremal Combinatorics. Springer.
19. A. V. Kostochka (1997). A bound of the cardinality of families not containing Δ-systems. In The mathematics of Paul Erdo{double acute}s, II, Algo rithms Combin., volume 14, 229-235. Springer.
20. R. Meshulam (1995). On Subsets of Finite Abelian Groups with No 3-Term Arithmetic Progressions. J. Comb. Theory, Ser. A 71(1), 168-172.
21. A. A. Razborov (1985). Lower bounds on the monotone complexity of some Boolean functions. Dokl. Akad. Nauk. SSSR281(4), 798-801. In Russian.
22. R. Salem & D. Spencer (1942). On sets of integers which contain no three in arithmetic progression. Proc. Nat. Acad. Sci. (USA) 28, 561.
23. J. Spencer (1977). Intersection Theorems for Systems of Sets. Canadian Math Bulletin 20(2), 249-254.
24. A. Stothers (2010). On the complexity of matrix multiplication. Ph. D. thesis, U. Edinburgh.
25. Strassen V (1969) Gaussian elimination is not optimal. Numer. Math 13: 354-356.
26. V. Strassen (1987). Relative bilinear complexity and matrix multi plication. J. Reine Angew. Math. 375/376, 406-443.
27. V. Vassilevska Williams (2012). Multiplying matrices faster than Coppersmith-Winograd. In Proceedings of the 44th annual STOC, 887-898.