Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic Original Research Article

In this paper an algorithm is described for the computation of the dimensions of all irreducible components of an algebraic variety over a zero characteristic ground field. The variety is given as a set of zeros of a family of polynomials of degree less than d in n variables. The working time of the algorithm is polynomial in the size of the input and dn.