Polynomial-time power-sum decomposition of polynomials
From MaRDI portal
Cited in
(5)- Learning arithmetic formulas in the presence of noise: a general framework and applications to unsupervised learning
- Complete decomposition of symmetric tensors in linear time and polylogarithmic precision
- On uniqueness of power sum decomposition
- Gaussian mixture identifiability from degree 6 moments
- Simple norm bounds for polynomial random matrices via decoupling
This page was built for publication: Polynomial-time power-sum decomposition of polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6942994)