most citedComputing the torsion points of a variety defined by lacunary polynomials

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

math.AG2013

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…

math.NT2009★ 1 cited

Computing the torsion points of a variety defined by lacunary polynomials

Louis Leroux

We present an algorithm for computing the set of torsion points satisfying a given system of multivariate polynomial equations. Its complexity is quasilinear in the logarithm of th…