Global properties of tensor rank
From MaRDI portal
Cites work
- Algebras Having Linear Multiplicative Complexities
- Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
- scientific article; zbMATH DE number 3873454 (Why is no real title available?)
- scientific article; zbMATH DE number 3461412 (Why is no real title available?)
- scientific article; zbMATH DE number 3514983 (Why is no real title available?)
- scientific article; zbMATH DE number 3408906 (Why is no real title available?)
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- Optimum computation of p bilinear forms
- Sur le calcul des produits de matrices. (Calculation of the product of matrices.)
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
Cited in
(14)- Generic and typical ranks of multi-way arrays
- Rank and optimal computation of generic tensors
- Typical tensorial rank
- Bounds on the ranks of some 3-tensors
- Monotonically convergent algorithms for symmetric tensor approximation
- Typical ranks for m n (m-1)n tensors with m n
- On general domain truncated correlation and convolution operators with finite rank
- Maximal bilinear complexity and codes
- On bilinear algorithms over fields of different characteristics
- Numerical tensor calculus
- Maximal rank of m n 2 tensors over arbitrary fields
- Non-interactive commitment from non-transitive group actions
- The complexity of tensor rank
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
This page was built for publication: Global properties of tensor rank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1250855)
