On sunflowers and matrix multiplication

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2012, Pages 214-223

  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; Sunflower Conjecture

Indexed keywords

FAST MATRIX MULTIPLICATION; LOWER BOUNDS; MATRIX MULTIPLICATION; SUNFLOWER CONJECTURE;

COMPUTATIONAL COMPLEXITY;

EID: 84866494999     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2012.26     Document Type: Conference Paper

References (28)

1. N. Alon and R. B. Boppana. The monotone circuit complexity of Boolean functions. Combinatorica 7 (1987), 1-22.
2. N. Alon and P. Pudlak. Constructive lower bounds for off-diagonal Ramsey numbers. Israel J. Math. 122 (2001), 243-251.
3. Zs. Baranyai. 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, 1975.
4. M. Batemand and N. H. Katz. New Bounds on cap sets. In arXiv:1101.5851v1, 2011.
5. P. Bürgisser, M. Clausen, and M. A. Shokrollahi. Algebraic Complexity Theory. Springer, 1997.
6. H. Cohn, R. D. Kleinberg, B. Szegedy, and C. Umans. Group-theoretic algorithms for matrix multiplication. In Proceedings of the 46th Annual FOCS, pages 379-388, 2005.
7. H. Cohn and C. Umans. A group-theoretic approach to fast matrix multiplication. In Proceedings of the 44th Annual FOCS, pages 438-449, 2003.
8. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progression. J. of Symbolic Computation, 9:251-280, 1990.
9. W. A. Deuber, P. Erdo{combining double acute accent}s, D. S. Gunderson, A. V. Kostochka, and A. G. Meyer. Intersection statements for systems of sets. J. Combin. Theory Ser. A 79 (1997), no. 1, 118-132.
10. Y. Edel. Extensions of generalized product caps. Designs, Codes and Cryptography 31 (2004), no. 1, 5-14.
11. P. Erdo{combining double acute accent}s and R. Rado. Intersection theorems for systems of sets. J. London Math. Soc., 35:85-90, 1960.
12. P. Erdo{combining double acute accent}s and R. Rado. Intersection theorems for systems of sets II. J. London Math. Soc., 44:467-479, 1969.
13. P. Erdo{combining double acute accent}s. Some unsolved problems in graph theory and combinatorial analysis. In Combinatorial Mathematics and its Applications (Proc. Conf., Oxford, 1969), pages 97-109. Academic Press, London, 1971.
14. P. Erdo{combining double acute accent}s. Problems and results on finite and infinite combinatorial analysis. In János Bolyai, editor, Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdo{combining double acute accent}s on his 60th birthday) Vol. I; Colloq. Math. Soc., volume 10, pages 403-424. North-Holland, Amsterdam, 1975.
15. P. Erdo{combining double acute accent}s. On the combinatorial problems which I would most like to see solved. Combinatorica, 1(1):25-42, 1981.
16. P. Erdo{combining double acute accent}s and E. Szemerédi. Combinatorial properties of systems of sets. J. Combinatorial Theory Ser. A, 24(3):308-313, 1978.
17. Z. Füredi. Turán type problems. In Surveys in combinatorics, 1991 (Guildford, 1991), 253-300, London Math. Soc. Lecture Note Ser., 166, Cambridge Univ. Press, Cambridge, 1991.
18. J. von zur Gathen. Algebraic complexity theory. Annual review of computer science, 3:317-347, 1988.
19. Stasys Jukna. Extremal Combinatorics. Springer, 2001.
20. A. V. Kostochka. A bound of the cardinality of families not containing Δ-systems. In: The mathematics of Paul Erdo{combining double acute accent}s, II, 229-235, Algorithms Combin., 14, Springer, Berlin, 1997.
21. R. Meshulam. On subsets of finite abelian groups with no 3-term arithmetic progressions. J. Combin. Theory Ser. A 71 (1995), 168-172.
22. A. A. Razborov. Lower bounds on the monotone complexity of some Boolean functions, (Russian). Dokl. Akad. Nauk SSSR 281 (1985), no. 4, 798-801.
23. R. Salem and D. Spencer. On sets of integers which contain no three in arithmetic progression. Proc. Nat. Acad. Sci. (USA), 28:561 563, 1942.
24. J. Spencer. Intersection theorems for systems of sets. Canadian Math Bulletin, 20(2):249-254, 1977.
25. V. Strassen. Gaussian elimination is not optimal. Numer. Math, 13:354-356, 1969.
26. V. Strassen. Relative bilinear complexity and matrix multiplication. J. Reine Angew. Math., 375/376:406-443, 1987.
27. A. Stothers. On the complexity of matrix multiplication. Ph.D. Thesis, U. Edinburgh, 2010.
28. V. Vassilevska Williams. Breaking the Coppersmith-Winograd barrier. Manuscript, 2011.