A note on border rank
- 30 March 1984
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 18 (3) , 173-178
- https://doi.org/10.1016/0020-0190(84)90023-1
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- O(n2.7799) complexity for n × n approximate matrix multiplicationPublished by Elsevier ,2002
- On the Asymptotic Complexity of Matrix MultiplicationSIAM Journal on Computing, 1982
- Partial and Total Matrix MultiplicationSIAM Journal on Computing, 1981