?. Soit-a, ?1) 0?i?n a i 2 i est la représentation binaire de a avec a n = 1, a i ? {0, 1} alors la longueur (taille binaire) de a, notée l(a) est définie par : l(a)

L. Longueur, taille binaire) d'un polynôme f ? Z[X 1, est le maximum des longueurs

. Si-f,-g-?-z-[-x-1, X n ] alors l(f + g) ? max {l(f ), l(g)} + 1 et l(f g) ? l(f ) + l(g) + 1

]. A. Aho, J. E. Hopcroft, and J. D. Ullman, (ou bien f (k) = o(g(k))) si pour tout > 0 il Bibliographie The design and analysis of computer algorithms, 1974.

M. E. Alonso, E. Becker, M. Roy, and T. Wormann, Zeros, multiplicities and idempotents for zero-dimensional systems, Algorithms in algebraic geometry and applications, pp.1-15, 1996.

G. E. Andrews, The theory of partitions, Encyclopedia of Mathematics and its Applications, 1976.

P. Aubry, Ensembles triangulaires de polynômes et résolution de systèmes algébriques. Inplantation en Axiom, Thèse doctorat, Université P. et M. Curie, 1999.

P. Aubry, D. Lazard, and M. Moreno, On the Theories of Triangular Sets, Journal of Symbolic Computation, vol.28, issue.1-2, pp.105-124, 1999.
DOI : 10.1006/jsco.1999.0269
URL : https://hal.archives-ouvertes.fr/hal-01148870

W. Auzinger, W. , and H. J. Stetter, An Elimination Algorithm for the Computation of All Zeros of a System of Multivariate Polynomial Equations, Proc. Intern. Conf. on Numerical Math, pp.12-30, 1988.
DOI : 10.1007/978-3-0348-6303-2_2

A. Ayad, Complexity bound of absolute factoring of parametric polynomials, Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI) Teor. Slozhn. Vychisl, vol.316, issue.9, pp.224-229, 2004.

S. Basu, R. Pollack, and M. Roy, Algorithms in real algebraic geometry, 2003.
DOI : 10.1007/978-3-662-05355-3
URL : https://hal.archives-ouvertes.fr/hal-01083587

M. Ben-or, D. Kozen, and J. Reif, The complexity of elementary algebra and geometry, Journal of Computer and System Sciences, vol.32, issue.2, pp.251-264, 1986.
DOI : 10.1016/0022-0000(86)90029-2

E. R. Berlekamp, Factoring polynomials over finite fields, Bell Systems Tech, J, vol.46, pp.1853-1859, 1967.

E. R. Berlekamp, Factoring polynomials over large finite fields, Mathematics of Computation, vol.24, issue.111, pp.713-735, 1970.
DOI : 10.1090/S0025-5718-1970-0276200-X

A. Bostan, G. Lecerf, B. Salvy, ´. E. Schost, and B. Wiebelt, Complexity issues in bivariate polynomial factorization, Proceedings of the 2004 international symposium on Symbolic and algebraic computation , ISSAC '04, pp.42-49, 2004.
DOI : 10.1145/1005285.1005294
URL : https://hal.archives-ouvertes.fr/hal-00186759

B. Buchberger and G. Bases, An algorithmic method in polynomial ideal theory, pp.374-383, 1985.
DOI : 10.1007/978-94-009-5225-6_6

J. Canny, D. Grigoriev, and N. Vorobjov, Finding connected components of a semialgebraic set in subexponential time, Applicable Algebra in Engineering, Communication and Computing, vol.313, issue.2, pp.217-238, 1992.
DOI : 10.1007/BF01614146

J. F. Canny, E. Kaltofen, and Y. N. Lakshman, Solving systems of nonlinear polynomial equations faster, Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation , ISSAC '89, pp.121-128, 1989.
DOI : 10.1145/74540.74556

J. F. Canny, Generalised characteristic polynomials, Journal of Symbolic Computation, vol.9, issue.3, pp.241-250, 1990.
DOI : 10.1016/S0747-7171(08)80012-0
URL : http://doi.org/10.1016/s0747-7171(08)80012-0

G. Chèze, Des méthodes symboliques-numériques et exactes pour la factorisation absolue des polynômes en deux variables, Thèse doctorat, 2004.

G. Chèze and G. Lecerf, Lifting and recombination techniques for absolute factorization, Manuscript, Université de Versailles Saint-Quentin-en-Yvelines, 2005.

G. Chèze and A. Galligo, From an approximate to an exact factorization, Prépublication de l, 2003.

A. L. Chistov, Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time, Journal of Soviet Mathematics, vol.100, issue.No. 4, pp.1838-1882, 1986.
DOI : 10.1007/BF01095643

A. L. Chistov and D. Grigoriev, Subexponential-time solving systems of algebraic equations, I and II, LOMI Preprint, pp.9-8310, 1983.

A. Chistov and D. Grigoriev, Complexity of quantifier elimination in the theory of algebraically closed fields, LNCS, vol.176, pp.17-31, 1984.
DOI : 10.1007/BFb0030287

A. Chistov and D. Grigoriev, Polynomial-time factoring of the multivariable polynomials over a global field, 1982.

A. Chistov, H. Fournier, L. Gurvits, and P. Koiran, Vandermonde Matrices, NP-Completeness, and Transversal Subspaces, Vandermonde Matrices, NP- Completeness, and Transversal Subspaces, pp.421-427, 2003.
DOI : 10.1007/s10208-002-0076-4

A. M. Cohen, J. H. Davenport, and A. J. Heck, An overview of computer algebra, In " Computer Algebra in Industry, Problem Solving in Practice, pp.1-52, 1991.

G. E. Collins, Quantifier elimination for real closed fields by cylindrical algebraic decompostion, Lect. Notes Comput. Sci, vol.33, pp.134-183, 1975.
DOI : 10.1007/3-540-07407-4_17

D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.1-6, 1987.
DOI : 10.1145/28395.28396
URL : http://dx.doi.org/10.1016/s0747-7171(08)80013-2

R. M. Corless, A. Galligo, I. S. Kotsireas, and S. M. Watt, A geometric-numeric algorithm for absolute factorization of multivariate polynomials, Proceedings of the 2002 international symposium on Symbolic and algebraic computation , ISSAC '02, pp.37-45, 2002.
DOI : 10.1145/780506.780512

D. Cox, J. Little, and D. , O'shea, Ideals, Varieties and Algorithms, 1997.

X. Dahan and E. Schost, Sharp estimates for triangular sets, Proceedings of the 2004 international symposium on Symbolic and algebraic computation , ISSAC '04, 2004.
DOI : 10.1145/1005285.1005302

J. Davenport and J. Heintz, Real quantifier elimination is doubly exponential, Journal of Symbolic Computation, vol.5, issue.1-2, pp.29-35, 1988.
DOI : 10.1016/S0747-7171(88)80004-X
URL : http://doi.org/10.1016/s0747-7171(88)80004-x

M. Elkadi and B. , Mourrain, A new algorithm for the geometric decomposition of a variety, Proceedings of the 1999 international symposium on Symbolic and algebraic computation, pp.9-16, 1999.

M. J. Encarnación, An Efficient Method for Computing Resultant Systems, Applicable Algebra in Engineering, Communication and Computing, pp.243-245, 1998.

J. C. Faugère, A new efficient algorithm for computing Gröbner bases without reduction to zero (F5, Proceedings of the 2002 international symposium on Symbolic and algebraic computation, pp.75-83, 2002.

J. C. Faugère, P. Gianni, D. Lazard, and T. Mora, Efficient Computation of Zero-dimensional Gr??bner Bases by Change of Ordering, Journal of Symbolic Computation, vol.16, issue.4, pp.329-344, 1993.
DOI : 10.1006/jsco.1993.1051

N. Fitchas, A. Galligo, and J. Morgenstern, Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields, Journal of Pure and Applied Algebra, vol.67, issue.1, pp.1-14, 1990.
DOI : 10.1016/0022-4049(90)90159-F
URL : http://doi.org/10.1016/0022-4049(90)90159-f

K. Gatermann and X. Bincan, Existence of 3 Positive Solutions of Systems from Chemistry, 2003.

S. Gao, Factoring multivariate polynomials via partial differential equations, Mathematics of Computation, vol.72, issue.242, pp.801-822, 2003.
DOI : 10.1090/S0025-5718-02-01428-X
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.4344

S. Gao, E. Kaltofen, J. May, Z. Yang, and L. Zhi, Approximate factorization of multivariate polynomials via differential equations, Proceedings of the 2004 international symposium on Symbolic and algebraic computation , ISSAC '04, pp.167-174, 2004.
DOI : 10.1145/1005285.1005311

X. Gao and S. Chou, Solving parametric algebraic systems, Papers from the international symposium on Symbolic and algebraic computation , ISSAC '92, pp.335-341, 1992.
DOI : 10.1145/143242.143348

P. Gianni and B. , Trager Gröbner bases and primary decomposition in polynomial ideals, Journal of Symbolic Computation, vol.6, pp.148-166, 1988.
DOI : 10.1016/s0747-7171(88)80040-3
URL : http://doi.org/10.1016/s0747-7171(88)80040-3

P. Gianni, Properties of Gröbner bases under specializations, LNCS, vol.87, issue.378, pp.293-297

M. Giusti and E. Schost, Solving some overdetermined polynomial systems, Proceedings of the 1999 international symposium on Symbolic and algebraic computation , ISSAC '99, pp.1-8, 1999.
DOI : 10.1145/309831.309838
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.3534

M. Giusti and J. Heintz, Algorithmes -disons rapides-pour la décomposition d'une variété algébrique en composantes irréductibles etéquidimensionnellesetéquidimensionnelles, Effective methods in algebraic geometry (Castiglioncello, pp.169-194, 1990.

M. Giusti, J. Heintz, K. Hagele, J. E. Morais, and L. M. Pardo, Lower bounds for diophantine approximations, Journal of Pure and Applied Algebra, vol.117, issue.118, pp.118-277, 1997.
DOI : 10.1016/S0022-4049(97)00015-7
URL : http://doi.org/10.1016/s0022-4049(97)00015-7

M. Giusti and J. Heintz, La détermination des points isolés et de la dimension d'une variété algébrique peut se faire en temps polynomial, Computational Algebraic Geometry and Commutative Algebra, Symposia Mathematics, pp.216-256, 1993.

M. Giusti, J. Heintz, J. E. Morais, and L. M. Pardo, When polynomial equation systems can be ???solved??? fast?, Lecture Notes in Computer Science, vol.948, pp.205-231, 1995.
DOI : 10.1007/3-540-60114-7_16
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.2737

M. Giusti, G. Lecerf, and B. Salvy, A Gr??bner Free Alternative for Polynomial System Solving, Journal of Complexity, vol.17, issue.1, pp.154-211, 2001.
DOI : 10.1006/jcom.2000.0571

M. Gonzalez-lopez, L. Gonzalez-vega, C. Traverso, and A. Zanoni, Gr??bner bases specialization through Hilbert functions, ACM SIGSAM Bulletin, vol.34, issue.1, pp.1-8, 2000.
DOI : 10.1145/373500.373501

M. Gonzalez-lopez and T. Recio, The ROMIN inverse geometric model and the dynamic evaluation method Computer Algebra in Industry, Problem Solving in Practice, pp.117-141, 1991.

H. Gräbe, On Factorized Gröbner Bases, Computer Algebra in Science and Engineering " Hehl, Küchlin) World Scientific Singapore, pp.77-89, 1995.

H. Gräbe, Minimal Primary Decomposition and Factorized Gröbner Bases, pp.265-278, 1997.

D. Grigoriev, Factorization of polynomials over a finite field and the solution of systems of algebraic equations, Journal of Soviet Mathematics, vol.100, issue.No. 4, pp.1762-1803, 1986.
DOI : 10.1007/BF01095638

D. Grigoriev, Complexity of quantifier elimination in the theory of ordinary differential equations, Lecture Notes Computer Science, vol.378, pp.11-25, 1989.
DOI : 10.1007/3-540-51517-8_81

D. Grigoriev and N. Vorobjov, Bounds on numbers of vectors of multiplicities for polynomials which are easy to compute, Proc. ACM Intern. Conf. Symb and Algebraic Computations, pp.137-145, 2000.

D. Grigoriev, Constructing double-exponential number of vectors of multiplicities of solutions of polynomial systems, In Contemporary Math., AMS, vol.286, pp.115-120, 2001.
DOI : 10.1090/conm/286/04758

D. Grigoriev and N. Vorobjov, Solving systems of polynomial inequalities in subexponential time, Journal of Symbolic Computation, vol.5, issue.1-2, pp.37-64, 1988.
DOI : 10.1016/S0747-7171(88)80005-1

D. Grigoriev, Complexity of deciding Tarski algebra, Journal of Symbolic Computation, vol.5, issue.1-2, pp.65-108, 1988.
DOI : 10.1016/S0747-7171(88)80006-3

A. Hashemi and D. Lazard, Sharper Complexity Bounds for Zero-dimensional Gröbner Bases and Polynomial System Solving, 2005.

J. Heintz, T. Krick, S. Puddu, J. Sabia, and A. Waissbein, Deformation Techniques for Efficient Polynomial Equation Solving, Journal of Complexity, vol.16, issue.1, pp.70-109, 2000.
DOI : 10.1006/jcom.1999.0529

J. Heintz, Definability and fast quantifier elimination in algebraically closed fields, Theoretical Computer Science, vol.24, issue.3, pp.239-277, 1983.
DOI : 10.1016/0304-3975(83)90002-6

J. Heintz, G. Matera, and A. Waissbein, On the Time-Space Complexity of Geometric Elimination Procedures, Applicable Algebra in Engineering, Communication and Computing, vol.11, issue.4, pp.239-296, 2001.
DOI : 10.1007/s002000000046

G. Jeronimo and J. Sabia, Effective equidimensional decomposition of affine varieties, Journal of Pure and Applied Algebra, vol.169, issue.2-3, pp.229-248, 2002.
DOI : 10.1016/S0022-4049(01)00083-4

M. Kalkbrenner, On the Stability of Gr??bner Bases Under Specializations, Journal of Symbolic Computation, vol.24, issue.1, pp.51-58, 1997.
DOI : 10.1006/jsco.1997.0113

E. Kaltofen, On the complexity of factoring polynomials with integer coefficients, Rensselaer Polytechnic Instit, 1982.

E. Kaltofen, Factorization of polynomials, Computer algebra, pp.95-113, 1983.

E. Kaltofen and V. Shoup, Subquadratic-time factoring of polynomials over finite fields, Proc. 27th Annual ACM Symp. Theory Comput, pp.398-406, 1995.

E. Kaltofen, Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization, SIAM Journal on Computing, vol.14, issue.2, pp.469-489, 1985.
DOI : 10.1137/0214035
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.592.3142

D. Kapur, An Approach for Solving Systems of Parametric Polynomial Equations , Principles and Practice of Constraint Programming, Saraswat and Van Hentenryck ), 1995.

T. Krick and L. M. Pardo, A computational method for diophantine approximation, Algorithms in algebraic geometry and applications, pp.193-253, 1994.

Y. N. Lakshman, A single exponential bound on the complexity of computing Gröbner bases of zero dimensional ideals, Effective methods in algebraic geometry, Progress in Mathematics, vol.94, pp.227-234, 1991.

S. Landau, Factoring Polynomials over Algebraic Number Fields, SIAM Journal on Computing, vol.14, issue.1, pp.184-195, 1985.
DOI : 10.1137/0214015

D. Lazard, Algèbre linéaire sur k[X 1 , . . . , X n ] etéliminationetélimination, Bull. Soc. Math. France, vol.105, pp.165-190, 1977.

D. Lazard, Resolution des systemes d'equations algebriques, Theoretical Computer Science, vol.15, issue.1, pp.77-110, 1981.
DOI : 10.1016/0304-3975(81)90064-5

D. Lazard, Gröbner-Bases, Gaussian elimination and resolution of systems of algebraic equations, pp.146-156, 1983.

D. Lazard, ON THE SPECIFICATION FOR SOLVERS OF POLYNOMIAL SYSTEMS, Computer Mathematics, pp.66-75, 2001.
DOI : 10.1142/9789812799661_0007
URL : https://hal.archives-ouvertes.fr/inria-00107534

D. Lazard and F. Rouillier, Solving parametric polynomial systems, Journal of Symbolic Computation, vol.42, issue.6, 2004.
DOI : 10.1016/j.jsc.2007.01.007
URL : https://hal.archives-ouvertes.fr/inria-00070678

D. Lazard, RESOLUTION OF POLYNOMIAL SYSTEMS, Computer Mathematics, pp.1-8, 2000.
DOI : 10.1142/9789812791962_0001
URL : https://hal.archives-ouvertes.fr/inria-00107866

D. Lazard, Solving zero-dimensional algebraic systems, Journal of Symbolic Computation, vol.13, issue.2, pp.117-131, 1992.
DOI : 10.1016/S0747-7171(08)80086-7

G. Lecerf, Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions, Proceedings of the 2000 international symposium on Symbolic and algebraic computation symbolic and algebraic computation , ISSAC '00, pp.209-216, 2000.
DOI : 10.1145/345542.345633
URL : https://hal.archives-ouvertes.fr/hal-00186755

G. Lecerf, Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers, Journal of Complexity, vol.19, issue.4, pp.564-596, 2003.
DOI : 10.1016/S0885-064X(03)00031-1
URL : https://hal.archives-ouvertes.fr/hal-00186727

A. K. Lenstra, H. W. Jr, L. Lenstra, and . Lovasz, Factoring polynomials with rational coefficients, Mathematische Annalen, vol.32, issue.4, pp.515-534, 1982.
DOI : 10.1007/BF01457454

A. K. Lenstra, Factoring multivariate polynomials over finite fields, Journal of Computer and System Sciences, vol.30, issue.2, pp.235-248, 1985.
DOI : 10.1016/0022-0000(85)90016-9
URL : http://doi.org/10.1016/0022-0000(85)90016-9

A. K. Lenstra, Factoring Multivariate Polynomials over Algebraic Number Fields, SIAM Journal on Computing, vol.16, issue.3, pp.591-598, 1987.
DOI : 10.1137/0216040

G. Lyubeznik, Minimal Resultant Systems, Journal of Algebra, vol.177, issue.2, pp.612-616, 1995.
DOI : 10.1006/jabr.1995.1315

F. S. Macaulay, The Algebraic Theory of Modular Systems, Cambridge Tracts in Mathematics and Mathematical Physics, 1916.

D. Manocha and J. Canny, MultiPolynomial Resultant Algorithms, Journal of Symbolic Computation, vol.15, issue.2, pp.99-122, 1993.
DOI : 10.1006/jsco.1993.1009

G. Matera and J. M. Torres, The Space Complexity of Elimination Theory: Upper Bounds, Foundations of Computational Mathematics, FOCM'97, pp.267-276, 1997.
DOI : 10.1007/978-3-642-60539-0_20

M. Mignotte and D. Stefanescu, Polynomials An Algorithmic Approach, 1999.

M. Mignotte, Mathématiques pour le calcul formel, Presses universitaires de France, 1989.

H. M. Moller and R. Tenberg, Multivariate Polynomial System Solving Using Intersections of Eigenspaces, Journal of Symbolic Computation, vol.32, issue.5, pp.513-531, 2001.
DOI : 10.1006/jsco.2001.0476

A. Montes, A New Algorithm for Discussing Gr??bner Bases with Parameters, Journal of Symbolic Computation, vol.33, issue.2, pp.183-208, 2002.
DOI : 10.1006/jsco.2001.0504
URL : http://doi.org/10.1006/jsco.2001.0504

D. Mumford, Algebraic Geometry I, Complex Projective Varieties, 1995.
DOI : 10.1007/978-3-642-61833-8

D. R. Musser, Multivariate Polynomial Factorization, Journal of the ACM, vol.22, issue.2, pp.291-309, 1975.
DOI : 10.1145/321879.321890
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.6002

D. R. Musser, Algorithms for polynomial factorization, 1971.

S. Puddu and J. Sabia, An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs, Journal of Pure and Applied Algebra, vol.129, issue.2, pp.173-200, 1997.
DOI : 10.1016/S0022-4049(97)00068-6

J. Ragot, Sur la factorisation absolue des polynômes, Thèsè a l'université de Limoges, 1997.

J. Renegar, On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals, Journal of Symbolic Computation, vol.13, issue.3, pp.255-352, 1992.
DOI : 10.1016/S0747-7171(10)80003-3

K. Rimey, Problem section (rotating fluids), ACM SIGSAM Bulletin, vol.18, issue.1, pp.30-32, 1984.
DOI : 10.1145/1089348.1089353

F. Rouillier, Solving zero-dimensional polynomial systems through the rational univariate representation, Tech. Rep, vol.3426, 1998.
URL : https://hal.archives-ouvertes.fr/inria-00073264

E. Schost, Computing Parametric Geometric Resolutions, Applicable Algebra in Engineering, Communication and Computing, vol.13, issue.5, pp.349-393, 2003.

E. Schost, Sur la résolution des systèmes polynomiauxàpolynomiauxà paramètres, Thèse de doctorat , ´ Ecole polytechnique, 2000.

E. Schost, Complexity results for triangular sets, Journal of Symbolic Computation, vol.36, issue.3-4, pp.555-594, 2003.
DOI : 10.1016/S0747-7171(03)00095-6

I. R. Shafarevich, Basic Algebraic Geometry, 1974.

W. Y. Sit, An algorithm for solving parametric linear systems, Journal of Symbolic Computation, vol.13, issue.4, pp.353-394, 1992.
DOI : 10.1016/S0747-7171(08)80104-6

W. Y. Sit, A theory for parametric linear systems, Proceedings of the 1991 international symposium on Symbolic and algebraic computation , ISSAC '91, pp.112-121, 1991.
DOI : 10.1145/120694.120709

A. J. Sommese, J. Verschelde, and C. W. Wampler, Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components, SIAM Journal on Numerical Analysis, vol.38, issue.6, pp.2022-2046, 2001.
DOI : 10.1137/S0036142900372549

A. J. Sommese, J. Verschelde, and C. W. Wampler, Numerical factorization of multivariate complex polynomials, Theoretical Computer Science, vol.315, issue.2-3, pp.2-3, 2004.
DOI : 10.1016/j.tcs.2004.01.011

J. Zur-gathen and J. Gerhard, Modern Computer algebra, 1999.
DOI : 10.1017/CBO9781139856065

J. Zur-gathen and E. Kaltofen, Factorization of multivariate polynomials over finite fields, Mathematics of Computation, vol.45, issue.171, pp.251-261, 1985.
DOI : 10.1090/S0025-5718-1985-0790658-X

D. Wang, Elimination Practice Software Tools and Applications, 2004.
DOI : 10.1142/9781848161207
URL : https://hal.archives-ouvertes.fr/hal-01503551

V. Weispfenning, Comprehensive Gr??bner bases, Journal of Symbolic Computation, vol.14, issue.1, pp.1-29, 1991.
DOI : 10.1016/0747-7171(92)90023-W

V. Weispfenning, Solving parametric polynomial equations and inequalities by symbolic algorithms, MIP-9504, Proc. of the workshop, pp.163-179, 1994.

V. Weispfenning, Quantifier elimination for real algebra---the cubic case, Proceedings of the international symposium on Symbolic and algebraic computation , ISSAC '94, pp.258-263, 1994.
DOI : 10.1145/190347.190425

L. Yang, Recent Advances on Determining the Number of Real Roots of Parametric Polynomials, Journal of Symbolic Computation, vol.28, issue.1-2, pp.225-242, 1999.
DOI : 10.1006/jsco.1998.0274

O. Zariski and P. Samuel, Commutative Algebra, 1958.
DOI : 10.1007/978-3-662-29244-0

H. Zassenhaus, On Hensel factorization, I, Journal of Number Theory, vol.1, issue.3, pp.291-311, 1969.
DOI : 10.1016/0022-314X(69)90047-X