Computing the complexification of a semi-algebraic set
Marie-Françoise Roy, Nicolai Vorobjov · 1996
We describe an algorithm for producing the smallest complex algebralc variety containing a given semi-algebraic set S, and all the irreducible components of S. Let S be defined by s polynomials of degrees less than d with integer coefficients of bit lengths less than A4.Then the complexity of the algorithm is bounded from above by a polynomial in M, Sn, dn'.The degree of the complexification is less than sndo 'n), while the degrees of polynomials defining the complexification and irreducible components are less than do(n) 1