Notions of tensor rank
From MaRDI portal
Recommendations
Cites work
- Gaussian elimination is not optimal
- scientific article; zbMATH DE number 3174491 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 7561763 (Why is no real title available?)
- Linear forms and higher-degree uniformity for functions on \(\mathbb F^n_p\)
- Most tensor problems are NP-hard
- Multiplying matrices faster than coppersmith-winograd
- New Fast Algorithms for Matrix Operations
- On cap sets and the group-theoretic approach to matrix multiplication
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- On multiplication of 2 2 matrices
- Powers of tensors and fast matrix multiplication
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- Structure vs. randomness for bilinear maps
- Tensor rank is hard to approximate
- The analytic rank of tensors and its applications
- The partition rank of a tensor and \(k\)-right corners in \(\mathbb{F}_q^n\)
This page was built for publication: Notions of tensor rank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6597977)