Proves ||g||_0 ≤ s^{D(2d+2)/e + 1} for f = g^e that is s-sparse with individual degree ≤ d and total degree D, then gives deterministic algorithm running in poly(s^{O(Dd)}, n, d, D) + s·R(e) time.
To appear / preprint , year =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree
Proves ||g||_0 ≤ s^{D(2d+2)/e + 1} for f = g^e that is s-sparse with individual degree ≤ d and total degree D, then gives deterministic algorithm running in poly(s^{O(Dd)}, n, d, D) + s·R(e) time.