Computing the torsion points of a variety defined by lacunary polynomials

Louis Patrick Leroux · Mathematics of Computation · 2011

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 the degree and in the height of the input equations but exponential in their number of variables and nonzero terms.

Read the paper · More papers on PaperTik