Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree

Qiao-Long Huang, Yichuan Cao, Ruichen Qiu +1

We study the problem of deterministically computing the exact root of a sparse polynomial in the multivariate setting. Let $f \in \F[x_1,\ldots,x_n]$ be a nonzero polynomial that i…