We design a deterministic algorithm that, given blackbox access to the product $f=\prod_{i=1}^{\ell}{h_i}$ of $\ell$ irreducible $s$-sparse $n$-variate polynomials of bounded individual degree $d$, over fields of characteristic zero, and more generally over fields of sufficiently large positive characteristic, recovers the $h_i$'s and their multiplicities in time $\mathrm{poly}(n,(s\ell d)^d)$. ... more >>>

We study sparse polynomials with bounded individual degree and the class of their factors. In particular we obtain the following algorithmic and structural results:

1. A deterministic polynomial-time algorithm for finding all the sparse divisors of a sparse polynomial with bounded individual degree. As part of this, we establish ... more >>>