Faster \& deterministic FPT algorithm for worst-case tensor decomposition
From MaRDI portal
Faster \& deterministic FPT algorithm for worst-case tensor decomposition
Cites work
- A generalization of Kruskal’s theorem on tensor decomposition
- A tensor approach to learning mixed membership community models
- Average-case complexity of tensor decomposition for low-degree polynomials
- Computing linear sections of varieties: quantum entanglement, tensor decompositions and beyond
- Deterministic factorization of sparse polynomials with bounded individual degree
- Dictionary learning and tensor decomposition via the sum-of-squares method
- Efficient Reconstruction of Random Multilinear Formulas
- Fourth-Order Cumulant-Based Blind Identification of Underdetermined Mixtures
- scientific article; zbMATH DE number 5899249 (Why is no real title available?)
- scientific article; zbMATH DE number 5968745 (Why is no real title available?)
- scientific article; zbMATH DE number 799791 (Why is no real title available?)
- Improved Explicit Hitting-Sets for ROABPs
- Kruskal's uniqueness inequality is sharp
- Learning arithmetic formulas in the presence of noise: a general framework and applications to unsupervised learning
- Learning functions represented as multiplicity automata
- Learning generalized depth three arithmetic circuits in the non-degenerate case
- Learning nonsingular phylogenies and hidden Markov models
- Learning sums of powers of low-degree polynomials in the non-degenerate case
- Most tensor problems are NP-hard
- On identity testing of tensors, low-rank recovery and compressed sensing
- On the complexity of k-SAT
- On the relation between polynomial identity testing and finding variable disjoint factors
- Queries and concept learning
- Random arithmetic formulas can be reconstructed efficiently
- Randomness efficient identity testing of multivariate polynomials
- Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits
- Reconstruction of non-degenerate homogeneous depth three circuits
- Solving systems of polynomial inequalities in subexponential time
- Tensor rank is NP-complete
- Tensor reconstruction beyond constant rank
This page was built for publication: Faster \& deterministic FPT algorithm for worst-case tensor decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346459)
