Rank and optimal computation of generic tensors
- 1 July 1983
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 52-53, 645-685
- https://doi.org/10.1016/0024-3795(83)80041-x
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- O(n2.7799) complexity for n × n approximate matrix multiplicationPublished by Elsevier ,2002
- Characterization of Division Algebras of Minimal Rank and the Structure of their Algorithm VarietiesSIAM Journal on Computing, 1983
- On the algorithmic complexity of associative algebrasTheoretical Computer Science, 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
- On varieties of optimal algorithms for the computation of bilinear mappings I. the isotropy group of a bilinear mappingTheoretical Computer Science, 1978
- Global properties of tensor rankLinear Algebra and its Applications, 1978
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statisticsLinear Algebra and its Applications, 1977
- Some bilinear forms whose multiplicative complexity depends on the field of constantsTheory of Computing Systems, 1976