C. Bajaj, . Canny, J. Garrity, and . Warren, Factoring Rational Polynomials over the Complex Numbers, SIAM Journal on Computing, vol.22, issue.2, pp.318-331465, 1993.
DOI : 10.1137/0222024

G. Chèze and A. Galligo, Four lectures on polynomial absolute factorization, Solving polynomial equations, pp.339-392, 2005.
DOI : 10.1007/3-540-27357-3_9

G. Chèze, A. Galligo-giesbrecht, M. Van-hoeij, I. S. Kotsireas, S. M. Watt et al., Towards factoring bivariate approximate polynomials Lifting and recombination techniques for absolute factorization Resultants and distribution of solutions of systems of polynomial equations The cutoff phenomenon in finite Markov chains How many zeros of a random polynomial are real?, Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation Proc. Nat. Acad. Sci. USADvH01] Bernard Deconinck and Mark van Hoeij. Computing Riemann matrices of algebraic curves. PhysicaDET50] P. Erdös and P. Turán. On the distribution of roots of polynomials, pp.682-696380, 1950.

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

]. 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

A. Galligo and A. Poteaux, Continuations and monodromy on random riemann surfaces, Proceedings of the 2009 conference on Symbolic numeric computation, SNC '09, pp.115-124, 2009.
DOI : 10.1145/1577190.1577210
URL : https://hal.archives-ouvertes.fr/inria-00438289

A. Galligo and M. Van-hoeij, Approximate bivariate factorization: a geometric viewpoint, SNC '07: Proceedings of the 2007 international workshop on Symbolic-numeric computation, pp.1-10, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00193647

A. Galligo and S. M. Watt, A numerical absolute primality test for bivariate polynomials The zeros of random polynomials cluster uniformly near the unit circle On the average number of real roots of a random algebraic equation II Challenges of symbolic computation: my favorite open problems, ACM. [HN08] Christopher Hughes and A. Nikeghbali, pp.217-224734, 1948.

A. Leykin and F. Sottile, Galois groups of Schubert problems via homotopy computation, Mathematics of Computation, vol.78, issue.267, pp.1749-1765, 2009.
DOI : 10.1090/S0025-5718-09-02239-X

A. Poteaux, Computing monodromy groups defined by plane algebraic curves, Proceedings of the 2007 International Workshop on Symbolicnumeric Computation, pp.36-45, 2007.

A. Poteaux, Calcul de développements de Puiseux et application au calcul de groupe de monodromie d'une courbe algébrique plane, 2008.

A. Poteaux and M. Rybowicz, Complexity Bounds for the rational Newton-Puiseux Algorithm over Finite Fields and Related Problems

A. Poteaux and M. Rybowicz, Good reduction of Puiseux series and applications, Journal of Symbolic Computation. [PR08]
DOI : 10.1016/j.jsc.2011.08.008
URL : https://hal.archives-ouvertes.fr/hal-00825850

A. Poteaux and M. Rybowicz, Good Reduction of Puiseux Series and Complexity of the Newton-Puiseux Algorithm, Proceedings of the ISSAC '08 Conference, pp.239-246, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00320600

D. Rupprechtsas01 and ]. T. Sasaki, Elements de géométrie algébrique approchée: Etude du pgcd et de la factorisation Approximate multivariate polynomial factorization based on zerosum relations, Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, pp.284-291, 2000.

T. Sasaki, M. Sasaki, M. Shub, and S. Smale, A unified method for multivariate polynomial factorizations, Proceedings MEGA' 92, pp.21-39, 1993.
DOI : 10.1007/BF03167201

T. Sasaki, T. Saito, T. Hilano, I. Japan, J. J. Industsvw01-]-a et al., Analysis of approximate factorization algorithm Using monodromy to decompose solution sets of polynomial systems into irreducible components Proceedings of a NATO Conference Symmetric functions applied to decomposing solution sets of polynomial systems Shiffman and S. Zelditch. Random polynomials with prescribed Newton polytope, Application of Algebraic Geometry to Coding Theory, Physics and Computation Tretkoff and M. D. Tretkoff. Combinatorial group theory, Riemann surfaces and differential equations Contributions to group theory, pp.351-368, 1984.

P. Valrose, 06108 Nice Cedex 02, France E-mail address: galligo@unice.fr URL: http://math1.unice.fr