Multiplying matrices faster than Coppersmith-Winograd

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2012, Pages 887-898

  Williams, Virginia Vassilevska ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

matrix multiplication

Indexed keywords

AUTOMATED APPROACH; MATRIX MULTIPLICATION; MATRIX MULTIPLICATION ALGORITHM;

COMPUTATION THEORY;

EID: 84862595166     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213977.2214056     Document Type: Conference Paper

References (21)

1. A. V. Aho, J. E. Hopcroft, and J. Ullman. The design and analysis of computer algorithms. Addison-Wesley Longman Publishing Co., Boston, MA, 1974.
2. N. Alon, A. Shpilka, and C. Umans. On sunflowers and matrix multiplication. ECCC TR11-067, 18, 2011.
3. F. A. Behrend. On the sets of integers which contain no three in arithmetic progression. Proc. Nat. Acad. Sci., pages 331-332, 1946.
4. 2.7799) complexity for n x n approximate matrix multiplication. Inf. Process. Lett., 8(5):234-235, 1979.
5. M. Bläser. Complexity of bilinear problems (lecture notes scribed by F. Endun). http://www-cc.cs.uni-saarland.de/teaching/SS09/ ComplexityofBilinearProblems/script.pdf,2009.
6. P. Bürgisser, M. Clausen, and M. A. Shokrollahi. Algebraic complexity theory, Grundlehren der mathematischen Wissenschaften. Springer-Verlag, Berlin, 1996.
7. H. Cohn, R. Kleinberg, B. Szegedy, and C. Umans. Group-theoretic algorithms for matrix multiplication. In Proc. FOCS, volume 46, pages 379-388, 2005.
8. H. Cohn and C. Umans. A group-theoretic approach to fast matrix multiplication. In Proc. FOCS, volume 44, pages 438-449, 2003.
9. D. Coppersmith and S. Winograd. On the asymptotic complexity of matrix multiplication. In Proc. SFCS, pages 82-90, 1981.
10. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symbolic Computation, 9(3):251-280, 1990.
11. P. Erdös and R. Rado. Intersection theorems for systems of sets. J. London Math. Soc., 35:85-90, 1960.
12. F. Le Gall. Personal communication.
13. E. Mossel, R. O'Donnell, and R. A. Servedio. Learning juntas. In Proc. STOC, pages 206-212, 2003.
14. V. Y. Pan. Strassen's algorithm is not optimal. In Proc. FOCS, volume 19, pages 166-176, 1978.
15. F. Romani. Some properties of disjoint sums of tensors related to matrix multiplication. SIAM J. Comput., pages 263-267, 1982.
16. R. Salem and D. Spencer. On sets of integers which contain no three terms in arithmetical progression. Proc. Nat. Acad. Sci., 28(12):561-563, 1942.
17. A. Schönhage. Partial and total matrix multiplication. SIAM J. Comput., 10(3):434-455, 1981.
18. A. Stothers. Ph.D. Thesis, U. Edinburgh, 2010.
19. V. Strassen. Gaussian elimination is not optimal. Numer. Math., 13:354-356, 1969.
20. V. Strassen. Relative bilinear complexity and matrix multiplication. J. reine angew. Math. (Crelles Journal), 375-376:406-443, 1987.
21. L. G. Valiant. General context-free recognition in less than cubic time. Journal of Computer and System Sciences, 10:308-315, 1975.