论文信息 - On the Asymptotic Complexity of Rectangular Matrix Multiplication - 字舞流文

On the Asymptotic Complexity of Rectangular Matrix Multiplication

Grazia Lotti | Francesco Romani | G. Lotti | F. Romani

[1] V. Strassen. Gaussian elimination is not optimal , 1969 .

[2] David P. Dobkin,et al. On the Number of Multiplications Required for Matrix Multiplication , 1976, SIAM J. Comput..

[3] Grazia Lotti,et al. O(n2.7799) Complexity for n*n Approximate Matrix Multiplication , 1979, Inf. Process. Lett..

[4] Victor Y. Pan,et al. New Fast Algorithms for Matrix Operations , 1980, SIAM J. Comput..

[5] Dario Bini. Relations between exact and approximate bilinear algorithms. Applications , 1980 .

[6] Grazia Lotti,et al. Approximate Solutions for the Bilinear Form Computational Problem , 1980, SIAM J. Comput..

[7] V. Pan. New combinations of methods for the acceleration of matrix multiplications , 1981 .

[8] Arnold Schönhage,et al. Partial and Total Matrix Multiplication , 1981, SIAM J. Comput..

[9] Don Coppersmith. Rapid Multiplication of Rectangular Matrices , 1982, SIAM J. Comput..

[10] Francesco Romani,et al. Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication , 1982, SIAM J. Comput..