The bit-operation complexity of matrix multiplication and of all pair shortest path problem
- 1 January 1981
- journal article
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 7 (5) , 431-438
- https://doi.org/10.1016/0898-1221(81)90130-9
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Some Properties of Disjoint Sums of Tensors Related to Matrix MultiplicationSIAM Journal on Computing, 1982
- Partial and Total Matrix MultiplicationSIAM Journal on Computing, 1981
- The bit-complexity of arithmetic algorithmsJournal of Algorithms, 1981
- New combinations of methods for the acceleration of matrix multiplicationsComputers & Mathematics with Applications, 1981
- New Fast Algorithms for Matrix OperationsSIAM Journal on Computing, 1980
- Complexity measures for matrix multiplication algorithmsCalcolo, 1980
- New Bounds on the Complexity of the Shortest Path ProblemSIAM Journal on Computing, 1976
- Schnelle Multiplikation großer ZahlenComputing, 1971
- Gaussian elimination is not optimalNumerische Mathematik, 1969