On the complexity of matrix multiplication
暂无分享,去创建一个
[1] F. Behrend. On Sets of Integers Which Contain No Three Terms in Arithmetical Progression. , 1946, Proceedings of the National Academy of Sciences of the United States of America.
[2] Shmuel Winograd,et al. A New Algorithm for Inner Product , 1968, IEEE Transactions on Computers.
[3] V. Strassen. Gaussian elimination is not optimal , 1969 .
[4] L. R. Kerr,et al. On Minimizing the Number of Multiplications Necessary for Matrix Multiplication , 1969 .
[5] Abraham Waksman. On Winograd's Algorithm for Inner Products , 1970, IEEE Transactions on Computers.
[6] Shmuel Winograd,et al. On multiplication of 2 × 2 matrices , 1971 .
[7] David P. Dobkin,et al. On the optimal evaluation of a set of bilinear forms , 1973, SWAT.
[8] Julian D. Laderman,et al. A noncommutative algorithm for multiplying $3 \times 3$ matrices using 23 multiplications , 1976 .
[9] Hans F. de Groote. On Varieties of Optimal Algorithms for the Computation of Bilinear Mappings. II. Optimal Algorithms for 2x2-Matrix Multiplication , 1978, Theor. Comput. Sci..
[10] Victor Y. Pan,et al. Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[11] G. Schachtel,et al. A Noncommutative Algorithm for Multiplying 5*5 Matrices Using 103 Multiplications , 1978, Inf. Process. Lett..
[12] Victor Y. Pan,et al. Field extension and trilinear aggregating, uniting and canceling for the acceleration of matrix multiplications , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[13] Victor Y. Pan,et al. New Fast Algorithms for Matrix Operations , 1980, SIAM J. Comput..
[14] Dario Bini. Relations between exact and approximate bilinear algorithms. Applications , 1980 .
[15] Arnold Schönhage,et al. Partial and Total Matrix Multiplication , 1981, SIAM J. Comput..
[16] Don Coppersmith,et al. On the Asymptotic Complexity of Matrix Multiplication , 1982, SIAM J. Comput..
[17] V. Pan. How can we speed up matrix multiplication , 1984 .
[18] M. F.,et al. Bibliography , 1985, Experimental Gerontology.
[19] Volker Strassen,et al. The asymptotic spectrum of tensors and the exponent of matrix multiplication , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[20] V. Strassen. Relative bilinear complexity and matrix multiplication. , 1987 .
[21] Don Coppersmith,et al. Matrix multiplication via arithmetic progressions , 1987, STOC.
[22] M. Liebeck,et al. Representations and Characters of Groups , 1995 .
[23] Markus Bläser. A 5/2 n2-Lower Bound for the Rank of n×n Matrix Multiplication over Arbitrary Fields , 1999, FOCS.
[24] A. ADoefaa,et al. ? ? ? ? f ? ? ? ? ? , 2003 .
[25] Christopher Umans,et al. A group-theoretic approach to fast matrix multiplication , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[26] Markus Bläser,et al. On the complexity of the multiplication of matrices of small formats , 2003, J. Complex..
[27] Markus Bläser. Beyond the Alder-Strassen bound , 2005, Theor. Comput. Sci..
[28] Christopher Umans. Group-theoretic algorithms for matrix multiplication , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).