COMPUTING THE DIMENSION OF A SEMI-ALGEBRAIC SET

摘要

This result slightly improves the result by Vorobjov, who described an algorithm with complexity bound (sd)~(O(k′(k-k′))) for the same problem. The complexity bound of the algorithm described in this paper has a better dependence on the number s of polynomials in the input.