Rank and optimal computation of generic tensors
type: Item
instance of: scholarly article
title: Rank and optimal computation of generic tensors
zbMATH Open document ID: 0514.15018
DOI: 10.1016/0024-3795(83)80041-X
published in: Linear Algebra and its Applications
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 15A72
Mathematics Subject Classification ID: 15A63
Mathematics Subject Classification ID: 15A69
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3811773
zbMATH Keywords: optimal computation of generic tensors
zbMATH Keywords: computational complexity
zbMATH Keywords: rank of tensors
zbMATH Keywords: optimal bilinear computations
zbMATH Keywords: perfect shape
author: Volker Strassen
MaRDI profile type: Publication
Wikidata QID: Q60307007
cites work: On the algorithmic complexity of associative algebras
cites work: Bounds on the ranks of some 3-tensors
cites work: On the maximal multiplicative complexity of a family of bilinear forms
cites work: Relations between exact and approximate bilinear algorithms. Applications
cites work: \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
cites work: Q4190138
cites work: Q4094392
cites work: Universality of iterated networks
cites work: Sur le calcul des produits de matrices. (Calculation of the product of matrices.)
cites work: On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping
cites work: On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication
cites work: On varieties of optimal algorithms for the computation of bilinear mappings. III. Optimal algorithms for the computation of \(xy\) and \(yx\) where \(x,y\in M_2(K)\)
cites work: Characterization of Division Algebras of Minimal Rank and the Structure of their Algorithm Varieties
cites work: Q3313974
cites work: Global properties of tensor rank
cites work: A remark on certain matrix varieties
cites work: Introduction to Lie Algebras and Representation Theory
cites work: Optimal evaluation of pairs of bilinear forms
cites work: Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
cites work: Base tensorielle des matrices de Hankel (ou de Toeplitz). Applications
cites work: Further Pathologies in Algebraic Geometry
cites work: Q5829318
cites work: Q5672731
cites work: Q4135685
cites work: The Computational Complexity of Continued Fractions
cites work: Q4047029
cites work: Some bilinear forms whose multiplicative complexity depends on the field of constants
description: scientific article; zbMATH DE number 3811773