Tensor Rank is Hard to Approximate
From MaRDI portal
Publication:5009520
DOI10.4230/LIPIcs.APPROX-RANDOM.2018.26OpenAlexW2805640305MaRDI QIDQ5009520
Publication date: 4 August 2021
Full work available at URL: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.26
Related Items (1)
Cites Work
- Tensor Decompositions and Applications
- The complexity of tensor rank
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- On the complexity of the multiplication of matrices of small formats
- Abelian tensors
- Gaussian elimination is not optimal
- On the max-min and tropical CP-rank conjectures
- Explicit Tensors
- Tensor-rank and lower bounds for arithmetic formulas
- Tensor rank is NP-complete
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- Low rank approximation with entrywise l 1 -norm error
- Generalized matrix completion and algebraic natural proofs
This page was built for publication: Tensor Rank is Hard to Approximate