Efficiently Computing Real Roots of Sparse Polynomials

Gorav Jindal, Michael Sagraloff

We propose an efficient algorithm to compute the real roots of a sparse polynomial $f\in \mathbb{R}[x]$ having $k$ non-zero real-valued coefficients. It is assumed that arbitrarily…