Abstract. In this paper we present algorithmic considerations and theoretical results about the relation between the orders of certain groups associated to the components of a poly...
This paper gives an algorithm for computing proper polynomial parametrizations for a particular class of curves. This class is characterized by the existence of a polynomial param...
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...