On the asymptotic complexity of rectangular matrix multiplication
- 31 December 1983
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 23 (2) , 171-185
- https://doi.org/10.1016/0304-3975(83)90054-3
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- O(n2.7799) complexity for n × n approximate matrix multiplicationPublished by Elsevier ,2002
- Rapid Multiplication of Rectangular MatricesSIAM Journal on Computing, 1982
- Some Properties of Disjoint Sums of Tensors Related to Matrix MultiplicationSIAM Journal on Computing, 1982
- Partial and Total Matrix MultiplicationSIAM Journal on Computing, 1981
- New combinations of methods for the acceleration of matrix multiplicationsComputers & Mathematics with Applications, 1981
- Approximate Solutions for the Bilinear Form Computational ProblemSIAM Journal on Computing, 1980
- New Fast Algorithms for Matrix OperationsSIAM Journal on Computing, 1980
- Relations between exact and approximate bilinear algorithms. ApplicationsCalcolo, 1980
- On the Number of Multiplications Required for Matrix MultiplicationSIAM Journal on Computing, 1976
- Gaussian elimination is not optimalNumerische Mathematik, 1969