A baby step-giant step roadmap algorithm for general algebraic sets

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 a roadmap of the set of zeros, Zer(Q, R), of Q in R. The complexity of the algorithm, measured by the number of arithmetic operations in the domain D, is bounded by d √ , where d = deg(Q) ≥ 2… CONTINUE READING