Complexity measures for matrix multiplication algorithms
- 1 January 1980
- journal article
- Published by Springer Nature in Calcolo
- Vol. 17 (1), 77-86
- https://doi.org/10.1007/bf02575864
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Approximate Solutions for the Bilinear Form Computational ProblemSIAM Journal on Computing, 1980
- Relations between exact and approximate bilinear algorithms. ApplicationsCalcolo, 1980
- O(n2.7799) complexity for n × n approximate matrix multiplicationInformation Processing Letters, 1979
- Schnelle Multiplikation großer ZahlenComputing, 1971
- Gaussian elimination is not optimalNumerische Mathematik, 1969