Several remarks on tensor rank computation
From MaRDI portal
Cites work
- Commuting extensions and cubature formulae
- Counterexamples to Strassen's direct sum conjecture
- Diophantine undecidability of \({\mathbb{C}{}}(t_ 1,t_ 2)\)
- Direct sum decomposability of polynomials and factorization of associated forms
- Gaussian elimination is not optimal
- Matrix multiplication via arithmetic progressions
- Minimal normal and commuting completions
- Most tensor problems are NP-hard
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- On the complexity of finding tensor ranks
- On the complexity of the multiplication of matrices of small formats
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- On the ranks and border ranks of symmetric tensors
- Partial and Total Matrix Multiplication
- Power sums, Gorenstein algebras, and determinantal loci. With an appendix `The Gotzmann theorems and the Hilbert scheme' by Anthony Iarrobino and Steven L. Kleiman
- Rank and optimal computation of generic tensors
- Sufficient conditions for Strassen's additivity conjecture
- Symmetric Tensors and Symmetric Tensor Rank
- Tensor rank is not multiplicative under the tensor product
- Tensor rank is NP-complete
- Tensor surgery and tensor rank
- The complexity of tensor rank
- The solution to the Waring problem for monomials and the sum of coprime monomials
- The tensor rank of tensor product of two three-qubit W states is eight
- The Waring rank of binary binomial forms
- The Waring rank of the 3 x 3 permanent
- Universal diophantine equation
- Waring loci and the Strassen conjecture
This page was built for publication: Several remarks on tensor rank computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6671381)
