Computing the torsion points of a variety defined by lacunary polynomials
classification
🧮 math.NT
math.AG
keywords
computingequationspointstorsionalgorithmcomplexitydefineddegree
read the original abstract
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 of the input equations and exponential in their number of non zero terms and variables.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.