论文信息 - Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic

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

Abstract 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 d n .

Alexander L. Chistov | A. Chistov

[1] Daniel Lazard,et al. Resolution des Systemes d'Equations Algebriques , 1981, Theor. Comput. Sci..

[2] A. L. Chistov. Polynomial complexity algorithms for computational problems in the theory of algebraic curves , 1992 .

[3] Alexander L. Chistov. Polynomial Complexity of the Newton-Puiseux Algorithm , 1986, MFCS.

[4] Alexander L. Chistov,et al. Polynomial-Time Computation of the Dimension of Algebraic Varieties in Zero-Characteristic , 1996, J. Symb. Comput..

[5] M-F Roy,et al. Géométrie algébrique réelle , 1987 .

[6] David Mumford,et al. Complex projective varieties , 1995 .