A. Chistov, Algorithm of polynomial complexity for factoring polynomials and nding the components of varieties in subexponential time, Translated from Zap. Nauchn. Semin. Leningrad. Odtel. Mat. Inst. Steklov (LOMI), vol.34, issue.4, pp.124-188, 1984.

A. Chistov, Polynomial-time computation of the dimensions of components of algebraic varieties in zero-characteristic, Journal of Pure and Applied A lgebra, 1997.

M. Giusti and J. Heintz, Algorithmes { disons rapides { pour la d ecomposition d'une vari et e a l g ebrique en composantes irr eductibles et equidimensionnelles, EEective Methods in Algebraic Geometry (MEGA'90), 1991.
DOI : 10.1007/978-1-4612-0441-1_11

M. Giusti and J. Heintz, La d etermination des points isol es et la dimension d'une vari et e a l g ebrique peut se faire en temps polynomial, Computational Algebraic Geometry and Commutative Algebra, pp.216-256, 1991.

R. Hartshorne, Graduate Texts in Mathematics, 1977.

P. Koiran, Hilbert's Nullstellensatz is in the polynomial hierarchy, 273{286, 1996. Long version: DIMACS report, vol.12, pp.96-123

P. Koiran, Elimination of parameters in the polynomial hierarchy, 1997.
URL : https://hal.archives-ouvertes.fr/hal-02101807

P. Koiran, Randomized and deterministic algorithms for the dimension of algebraic varieties, Proc. 38th IEEE Symposium on Foundations of Computer Science, pp.36-45, 1997.