Overdetermined systems of sparse polynomial equations

Francesco Amoroso, Louis Leroux, Martin Sombra

We show that, for a system of univariate polynomials given in sparse encoding, we can compute a single polynomial defining the same zero set, in time quasi-linear in the logarithm…