We present an efficient algorithm for the transformation of a Grobner basis of a zero-dimensional ideal with respect to any given ordering into a GroBner basis withrespect to any other ordering.Expand

We give an algorithm which represents the radical J of a finitely generated differential ideal as an intersection of radical differential ideals.Expand

We study the theoretical relationship between these various approaches to triangular sets, namely characteristic set (Ritt, 1932; Wu, 1984a), regular chain and representation of a regular chain.Expand

We reduce the computations of multivariate polynomials which have a finite number of common zeros in the algebraic closure of the ground field to the resolution of a single univariate equation.Expand

In the past few years, two very different methods have been developed for solving systems of algebraic equations : the method of Gr6bner bases or standard bases [Buc I, Buc 2, Tri, P.Y] and the one which I presented in Eurosam 79 [Laz 2, Laz 3] based on gaussian elimination in some matrices.Expand

We present a new algorithm for solving basic parametric constructible or semi-algebraic systems of the form C={x@?C^n,p"1(x)=0,...,p"s(x)=0,f"1(x) 0,...,f"l(x) 0} or… Expand