暂无分享,去创建一个
[1] Vladimir P. Burichenko,et al. Symmetries of matrix multiplication algorithms. I , 2015, ArXiv.
[2] J. M. Landsberg,et al. Equations for Lower Bounds on Border Rank , 2013, Exp. Math..
[3] A. Davie,et al. Improved bound for complexity of matrix multiplication , 2013, Proceedings of the Royal Society of Edinburgh: Section A Mathematics.
[4] Rodney W. Johnson,et al. Noncommutative Bilinear Algorithms for 3 x 3 Matrix Multiplication , 1986, SIAM J. Comput..
[5] Gregory V. Bard,et al. A New General-Purpose Method to Multiply 3x3 Matrices Using Only 23 Multiplications , 2011, ArXiv.
[6] V. Strassen. Gaussian elimination is not optimal , 1969 .
[7] J. M. Landsberg,et al. A $2n^2-log(n)-1$ lower bound for the border rank of matrix multiplication , 2016, ArXiv.
[8] Andris Ambainis,et al. Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd Method , 2014, STOC.
[9] Piotr Sankowski,et al. Maximum weight bipartite matching in matrix multiplication time , 2009, Theor. Comput. Sci..
[10] L. R. Kerr,et al. On Minimizing the Number of Multiplications Necessary for Matrix Multiplication , 1969 .
[11] J. M. Landsberg,et al. New Lower Bounds for the Rank of Matrix Multiplication , 2012, SIAM J. Comput..
[12] Vladimir P. Burichenko. On symmetries of the Strassen algorithm , 2014, ArXiv.
[13] Virginia Vassilevska Williams,et al. Multiplying matrices faster than coppersmith-winograd , 2012, STOC '12.
[14] Markus Bläser. A 5/2 n2-Lower Bound for the Rank of n×n Matrix Multiplication over Arbitrary Fields , 1999, FOCS.
[15] Shmuel Winograd,et al. On multiplication of 2 × 2 matrices , 1971 .
[16] Julian D. Laderman,et al. A noncommutative algorithm for multiplying $3 \times 3$ matrices using 23 multiplications , 1976 .
[17] Peter Bürgisser,et al. Geometric complexity theory and tensor rank , 2010, STOC '11.
[18] J. M. Landsberg,et al. On the Geometry of Border Rank Algorithms for n × 2 by 2 × 2 Matrix Multiplication , 2015, Exp. Math..
[19] Markus Bläser,et al. On the complexity of the multiplication of matrices of small formats , 2003, J. Complex..
[20] J. M. Landsberg,et al. On the geometry of border rank algorithms for matrix multiplication and other tensors with symmetry , 2016, ArXiv.
[21] Arnold Schönhage,et al. Partial and Total Matrix Multiplication , 1981, SIAM J. Comput..
[22] Alfred Young. On Quantitative Substitutional Analysis , 1928 .
[23] Uri Zwick,et al. All pairs shortest paths using bridging sets and rectangular matrix multiplication , 2000, JACM.
[24] J. Landsberg. The border rank of the multiplication of 2×2 matrices is seven , 2005 .
[25] G. Schachtel,et al. A Noncommutative Algorithm for Multiplying 5*5 Matrices Using 103 Multiplications , 1978, Inf. Process. Lett..
[26] François Le Gall,et al. Powers of tensors and fast matrix multiplication , 2014, ISSAC.
[27] J. M. Landsberg,et al. The geometry of rank decompositions of matrix multiplication II: 3×3 matrices , 2018, Journal of Pure and Applied Algebra.
[28] Don Coppersmith,et al. Matrix multiplication via arithmetic progressions , 1987, STOC.
[29] Dario Bini. Relations between exact and approximate bilinear algorithms. Applications , 1980 .
[30] Markus Bläser,et al. Fast Matrix Multiplication , 2013, Theory Comput..