Notions of tensor rank
From MaRDI portal
Publication:6597977
zbMATH Open1547.15021MaRDI QIDQ6597977FDOQ6597977
Mandar Juvekar, Arian Nadjimzadah
Publication date: 4 September 2024
Published in: Online Journal of Analytic Combinatorics (Search for Journal in Brave)
Multilinear algebra, tensor calculus (15A69) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Vector spaces, linear dependence, rank, lineability (15A03)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Powers of tensors and fast matrix multiplication
- Most Tensor Problems Are NP-Hard
- Gaussian elimination is not optimal
- Multiplying matrices faster than coppersmith-winograd
- On multiplication of 2 \(\times\) 2 matrices
- New Fast Algorithms for Matrix Operations
- Linear forms and higher-degree uniformity for functions on \(\mathbb F^n_p\)
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- Tensor Rank is Hard to Approximate
- On cap sets and the group-theoretic approach to matrix multiplication
- The analytic rank of tensors and its applications
- The partition rank of a tensor and \(k\)-right corners in \(\mathbb{F}_q^n\)
- Structure vs. randomness for bilinear maps
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)
