Faster algorithms for rectangular matrix multiplication

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2012, Pages 514-523

  Le Gall, François ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

algorithms; matrix multiplication; rectangular matrices

Indexed keywords

ARITHMETIC OPERATIONS; INTEGER WEIGHTS; MATRIX MULTIPLICATION; MAXIMAL VALUES; N-MATRIX; RECTANGULAR MATRIX; SHORTEST PATH; SQUARE MATRICES; SYMBOLIC COMPUTATION; TIME ALGORITHMS; TIME COMPLEXITY; UPPER BOUND;

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE;

ALGORITHMS;

EID: 84871999253     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2012.80     Document Type: Conference Paper

References (29)

1. N. Alon, A. Shpilka, and C. Umans, "On sunflowers and matrix multiplication," in Proceedings of the 27th Conference on Computational Complexity, 2012, pp. 214-223.
2. N. Alon and R. Yuster, "Fast algorithms for maximum subset matching and all-pairs shortest paths in graphs with a (not so) small vertex cover," in Proceedings of the 15th Annual European Symposium on Algorithms, 2007, pp. 175-186.
3. R. R. Amossen and R. Pagh, "Faster join-projects and sparse matrix multiplications," in Proceedings of the 12th International Conference on Database Theory, 2009, pp. 121-126.
4. P. Bürgisser, M. Clausen, and M. A. Shokrollahi, Algebraic complexity theory. Springer, 1997.
5. 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, 2005, pp. 379-388.
6. H. Cohn and C. Umans, "A group-theoretic approach to fast matrix multiplication," in Proceedings of the 44th Symposium on Foundations of Computer Science, 2003, pp. 438-449.
7. D. Coppersmith, "Rapid multiplication of rectangular matrices," SIAM Journal on Computing, vol. 11, no. 3, pp. 467-471, 1982.
8. -, "Rectangular matrix multiplication revisited," Journal of Complexity, vol. 13, no. 1, pp. 42-49, 1997.
9. D. Coppersmith and S. Winograd, "Matrix multiplication via arithmetic progressions," Journal of Symbolic Computation, vol. 9, no. 3, pp. 251-280, 1990.
10. A. Czumaj, M. Kowaluk, and A. Lingas, "Faster algorithms for finding lowest common ancestors in directed acyclic graphs," Theoretical Computer Science, vol. 380, no. 1-2, pp. 37-46, 2007.
11. C. Demetrescu and G. F. Italiano, "Fully dynamic transitive closure: Breaking through the o(n2) barrier," in Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000, pp. 381-389.
12. X. Huang and V. Y. Pan, "Fast rectangular matrix multiplication and applications," Journal of Complexity, vol. 14, no. 2, pp. 257-299, 1998.
13. H. Kaplan, N. Rubin, M. Sharir, and E. Verbin, "Counting colors in boxes," in Proceedings of the 18th Annual ACMSIAM Symposium on Discrete Algorithms, 2007, pp. 785-794.
14. H. Kaplan, M. Sharir, and E. Verbin, "Colored intersection searching via sparse rectangular matrix multiplication," in Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006, pp. 52-60.
15. S. Ke, B. Zeng, W. Han, and V. Y. Pan, "Fast rectangular matrix multiplication and some applications," Science in China Series A: Mathematics, vol. 51, no. 3, pp. 389-406, 2008.
16. G. Lotti and F. Romani, "On the asymptotic complexity of rectangular matrix multiplication," Theoretical Computer Science, vol. 23, pp. 171-185, 1983.
17. M. Patrascu and R. Williams, "On the possibility of faster SAT algorithms," in Proceedings of the 21st Annual ACMSIAM Symposium on Discrete Algorithms, 2010, pp. 1065-1075.
18. L. Roditty and A. Shapira, "All-pairs shortest paths with a sublinear additive error," ACM Transactions on Algorithms, vol. 7, no. 4, p. 45, 2011.
19. P. Sankowski and M. Mucha, "Fast dynamic transitive closure with lookahead," Algorithmica, vol. 56, no. 2, pp. 180-197, 2010.
20. A. Schönhage, "Partial and total matrix multiplication," SIAM Journal on Computing, vol. 10, no. 3, pp. 434-455, 1981.
21. A. Stothers, "On the complexity of matrix multiplication," Ph.D. dissertation, University of Edinburgh, 2010.
22. V. Strassen, "Relative bilinear complexity and matrix multiplication," Journal für die reine und angewandte Mathematik, vol. 375-376, pp. 406-443, 1987.
23. V. Vassilevska Williams, "Multiplying matrices faster than Coppersmith-Winograd," in Proceedings of the 44th ACM Symposium on Theory of Computing, 2012, pp. 887-898.
24. R. Williams, "Non-uniform ACC circuit lower bounds," in Proceedings of the 26th Annual IEEE Conference on Computational Complexity, 2011, pp. 115-125.
25. R. Yuster, "Efficient algorithms on sets of permutations, dominance, and real-weighted APSP," in Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, 2009, pp. 950-957.
26. R. Yuster and U. Zwick, "Detecting short directed cycles using rectangular matrix multiplication and dynamic programming," in Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, 2004, pp. 254-260.
27. -, "Fast sparse matrix multiplication," ACM Transactions on Algorithms, vol. 1, no. 1, pp. 2-13, 2005.
28. U. Zwick, "All pairs lightest shortest paths," in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, pp. 61-69.
29. -, "All pairs shortest paths using bridging sets and rectangular matrix multiplication," Journal of the ACM, vol. 49, no. 3, pp. 289-317, 2002.