Typical tensorial rank
- 1 August 1985
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 69, 95-120
- https://doi.org/10.1016/0024-3795(85)90070-9
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- O(n2.7799) complexity for n × n approximate matrix multiplicationPublished by Elsevier ,2002
- A note on border rankInformation Processing Letters, 1984
- Rank and optimal computation of generic tensorsLinear Algebra and its Applications, 1983
- Partial and Total Matrix MultiplicationSIAM Journal on Computing, 1981
- Bounds on the ranks of some 3-tensorsLinear Algebra and its Applications, 1980
- On the maximal multiplicative complexity of a family of bilinear formsLinear Algebra and its Applications, 1979
- On varieties of optimal algorithms for the computation of bilinear mappings II. optimal algorithms for 2 × 2-matrix multiplicationTheoretical Computer Science, 1978
- Global properties of tensor rankLinear Algebra and its Applications, 1978
- On multiplication of 2 × 2 matricesLinear Algebra and its Applications, 1971
- Sur le calcul des produits de matricesNumerische Mathematik, 1971