Group-Theoretic Partial Matrix Multiplication - Department of ...
Group-Theoretic Partial Matrix Multiplication - Department of ...
Group-Theoretic Partial Matrix Multiplication - Department of ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
References<br />
[1] P. Bürgisser, M. Clausen, and M.A. Shokrollahi. Algebraic Complexity Theory.<br />
Springer, 1997.<br />
[2] H. Cohn, R. Kleinberg, B. Szegedy, and C. Umans. <strong>Group</strong>-theoretic algorithms<br />
for matrix multiplication. Foundations <strong>of</strong> Computer Science. 46th<br />
Annual IEEE Symposium on, pages 23–25, 2005.<br />
[3] H. Cohn and C. Umans. A group-theoretic approach to fast matrix multiplication.<br />
Foundations <strong>of</strong> Computer Science, 2003. Proceedings. 44th Annual<br />
IEEE Symposium on, pages 438–449, 2003.<br />
[4] D. Coppersmith and S. Winograd. <strong>Matrix</strong> multiplication via arithmetic<br />
progressions. Journal <strong>of</strong> Symbolic Computation, 9(3):251–280, 1990.<br />
[5] J.M. Harris, J.L. Hirst, and M.J. Mossingh<strong>of</strong>f. Combinatorics and Graph<br />
Theory. Springer, 2000.<br />
[6] J.E. Hopcr<strong>of</strong>t and R.M. Karp. An n 5/2 Algorithm for Maximum Matchings<br />
in Bipartite Graphs. SIAM Journal on Computing, 2:225, 1973.<br />
[7] A. Schönhage. <strong>Partial</strong> and Total <strong>Matrix</strong> <strong>Multiplication</strong>. SIAM Journal on<br />
Computing, 10:434, 1981.<br />
[8] V. Strassen. Gaussian elimination is not optimal. Numerische Mathematik,<br />
13(4):354–356, 1969.<br />
14
Change language