O(n2.7799) complexity for n × n approximate matrix multiplication
- 1 June 1979
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 8 (5), 234-235
- https://doi.org/10.1016/0020-0190(79)90113-3
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear FormsSIAM Journal on Computing, 1973
- Gaussian elimination is not optimalNumerische Mathematik, 1969