Powers of tensors and fast matrix multiplication

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2014, Pages 296-303

  Le Gall, François ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

Algebraic complexity theory; Matrix multiplication

Indexed keywords

CONVEX OPTIMIZATION; POLYNOMIAL APPROXIMATION; TENSORS;

ALGEBRAIC COMPLEXITY THEORIES; ALGEBRAIC CONSTRUCTIONS; ASYMPTOTIC COMPLEXITY; FAST MATRIX MULTIPLICATION; MATRIX MULTIPLICATION; POLYNOMIAL TIME COMPLEXITY; SQUARE MATRICES; SYMBOLIC COMPUTATION;

MATRIX ALGEBRA;

EID: 84920038976     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2608628.2608664     Document Type: Conference Paper

References (17)

1. N. Alon, A. Shpilka, and C. Umans. On sunflowers and matrix multiplication. Computational Complexity, 22(2):219-243, 2013.
2. A. Ben-Tal and A. Nemirovski. Lectures on Modern Convex Optimization. SIAM, 2001.
3. M. Bläser. Fast Matrix Multiplication. Number 5 in Graduate Surveys. Theory of Computing Library, 2013.
4. S. Boyd and L. Vandenberghe. Convex optimization. Cambridge University Press, 2004.
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 IEEE Symposium on Foundations of Computer Science, pages 379-388, 2005.
7. H. Cohn and C. Umans. Fast matrix multiplication using coherent configurations. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1074-1087, 2013.
8. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9(3):251-280, 1990.
9. A. M. Davie and A. J. Stothers. Improved bound for complexity of matrix multiplication. Proceedings of the Royal Society of Edinburgh, 143A:351-370, 2013.
10. S.-C. Fang and J. H.-S. Tsao. Entropy optimization: interior point methods. In Encyclopedia of Optimization, pages 544-548. Springer, 2001.
11. Y. Filmus. Matrix multiplication I and II, 2014. Lecture notes available at http://www.cs.toronto.edu/~yuvalf/.
12. F. Le Gall. Faster algorithms for rectangular matrix multiplication. In Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, pages 514-523, 2012.
13. A. Schönhage. Partial and total matrix multiplication. SIAM Journal on Computing, 10(3):434-455, 1981.
14. A. Stothers. On the Complexity of Matrix Multiplication. PhD thesis, University of Edinburgh, 2010.
15. V. Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 13:354-356, 1969.
16. V. Strassen. The asymptotic spectrum of tensors and the exponent of matrix multiplication. In Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, pages 49-54, 1986.
17. V. Vassilevska Williams. Multiplying matrices faster than Coppersmith-Winograd. In Proceedings of the 44th ACM Symposium on Theory of Computing, pages 887-898, 2012. Most recent version available at the author's homepage.