I. S. Cohen, On the structure and ideal theory of complete local rings, Transactions of the American Mathematical Society, vol.59, issue.1, pp.54-106, 1946.
DOI : 10.1090/S0002-9947-1946-0016094-3

V. Cossart and O. Piltant, Resolution of singularities of threefolds in positive characteristic. I., Journal of Algebra, vol.320, issue.3, pp.1051-1082, 2008.
DOI : 10.1016/j.jalgebra.2008.03.032
URL : https://hal.archives-ouvertes.fr/hal-00139124

V. Cossart and O. Piltant, Resolution of singularities of threefolds in positive characteristic. I., Journal of Algebra, vol.320, issue.3, pp.1836-1976, 2009.
DOI : 10.1016/j.jalgebra.2008.03.032
URL : https://hal.archives-ouvertes.fr/hal-00139124

]. J. Die68 and . Dieudonné, Calcul infinitésimal, 1968.

C. Durvye and G. Lecerf, A concise proof of the Kronecker polynomial system solver from scratch, Expositiones Mathematicae, vol.26, issue.2, pp.101-139, 2008.
DOI : 10.1016/j.exmath.2007.07.001
URL : https://hal.archives-ouvertes.fr/hal-00682083

J. [. Fröhlich and . Shepherdson, Effective Procedures in Field Theory, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol.248, issue.950, pp.407-432, 1956.
DOI : 10.1098/rsta.1956.0003

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

J. Zur-gathen and J. Gerhard, Modern computer algebra, 2003.
DOI : 10.1017/CBO9781139856065

J. U. Giraud and . Mathématique, Étude locale des singularités, 1971.

J. Giraud, Contact maximal en caract??ristique positive, Annales scientifiques de l'??cole normale sup??rieure, vol.8, issue.2, pp.201-234, 1975.
DOI : 10.24033/asens.1286

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

T. Granlund, GMP, the GNU multiple precision arithmetic library Available from http, 1991.

E. Hallouin, Computing Local Integral Closures, Journal of Symbolic Computation, vol.32, issue.3, pp.211-230, 2001.
DOI : 10.1006/jsco.2001.0447
URL : http://doi.org/10.1006/jsco.2001.0447

]. H. Hir64 and . Hironaka, Resolution of singularities of an algebraic variety over a field of characteristic zero. I, II, Ann. of Math, vol.79, issue.22, pp.79-109, 1964.

H. Hironaka, Characteristic polyhedra of singularities, Journal of Mathematics of Kyoto University, vol.7, issue.3, pp.251-293, 1967.
DOI : 10.1215/kjm/1250524227

]. H. Hir70 and . Hironaka, Additive groups associated with points of a projective space, Ann. of Math, vol.92, issue.2, pp.327-334, 1970.

J. Van-der-hoeven, Available from http, 2002.

M. Van-hoeij, An Algorithm for Computing an Integral Basis in an Algebraic Function Field, Journal of Symbolic Computation, vol.18, issue.4, pp.353-363, 1994.
DOI : 10.1006/jsco.1994.1051

J. Van-der-hoeven, W. W. Küchlin, and I. '. Éditeur, Lazy multiplication of formal power series, Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97, pp.17-20, 1997.
DOI : 10.1145/258726.258738

]. J. Bibliographie-[-hoe02 and . Van-der-hoeven, Relax, but don't be too lazy, J. Symbolic Comput, vol.34, issue.6, pp.479-542, 2002.

T. Krick, L. M. Pardo, and M. Sombra, Sharp estimates for the arithmetic Nullstellensatz, Duke Math. J, vol.109, issue.3, pp.521-598, 2001.

S. Lang, Algebra, volume 211 de Graduate Texts in Mathematics, 2002.

G. Lecerf, Improved dense multivariate polynomial factorization algorithms, Journal of Symbolic Computation, vol.42, issue.4, pp.477-494, 2007.
DOI : 10.1016/j.jsc.2007.01.003
URL : https://hal.archives-ouvertes.fr/hal-00186740

G. Lecerf, Fast separable factorization and applications, Applicable Algebra in Engineering, Communication and Computing, vol.102, issue.1, pp.135-160, 2008.
DOI : 10.1007/s00200-008-0062-4
URL : https://hal.archives-ouvertes.fr/hal-00681420

G. Lecerf, New recombination algorithms for bivariate polynomial factorization based on Hensel lifting, Applicable Algebra in Engineering, Communication and Computing, vol.95, issue.2, pp.151-176, 2010.
DOI : 10.1007/s00200-010-0121-5
URL : https://hal.archives-ouvertes.fr/hal-00157496

]. D. Mck01 and . Mckinnon, An arithmetic analogue of Bézout's theorem, Compositio Math, vol.126, issue.2, pp.147-155, 2001.

A. M. Ostrowski, Über die Bedeutung der Theorie der konvexen Polyeder für die formale Algebra, Talk given at Der Deutsche Mathematikertag vom, pp.98-99, 1921.

]. A. Ost75 and . Ostrowski, On multiplication and factorization of polynomials. I. Lexicographic orderings and extreme aggregates of terms, Aequationes Math, vol.13, issue.3, pp.201-228, 1975.

]. A. Ost99 and . Ostrowski, On the significance of the theory of convex polyhedra for formal algebra, SIGSAM Bull, vol.33, issue.15, 1999.

B. Rubin, Inversion formulas for the spherical Radon transform and the generalized cosine transform, Advances in Applied Mathematics, vol.29, issue.3, pp.471-497, 2002.
DOI : 10.1016/S0196-8858(02)00028-3

]. I. Sha94 and . Shafarevich, Basic algebraic geometry Varieties in projective space, Translated from the, 1988.

M. Shub, Complexity of Bézout's theorem. VI. Geodesics in the condition (number) metric. Found, Comput. Math, vol.9, issue.2, pp.171-178, 2009.

M. Shub and S. Smale, Complexity of Bézout's theorem. I. Geometric aspects, J. Amer. Math. Soc, vol.6, issue.2, pp.459-501, 1993.

M. Shub and S. Smale, Complexity of Bézout's theorem. II. Volumes and probabilities. Dans Computational algebraic geometry (Nice, Progr. Math. Birkhäuser Boston, vol.109, pp.267-285, 1992.

M. Bardet, J. Faugère, and B. Salvy, On the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations, International Conference on Polynomial System Solving -ICPSS, pp.71-75, 2004.

J. Berthomieu, P. Hivert, and H. Mourtada, Computing Hironaka???s invariants: ridge and directrix, Arithmetic, Geometry, Cryptography and Coding Theory, pp.9-20, 2009.
DOI : 10.1090/conm/521/10269
URL : http://hal.archives-ouvertes.fr/docs/00/49/28/24/PDF/2009_-_Computing_Hironaka_s_invariants_Ridge_And_Directrix.pdf

G. [. Decker, G. Greuel, H. Pfister, and . Schönemann, Singular 3-1- 3 ? A computer algebra system for polynomial computations Available from http, 2011.

A. Fröhlich and J. C. Shepherdson, Effective Procedures in Field Theory, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol.248, issue.950, pp.407-432, 1956.
DOI : 10.1098/rsta.1956.0003

J. Zur-gathen, Hensel and Newton methods in valuation rings, Mathematics of Computation, vol.42, issue.166, pp.637-661, 1984.
DOI : 10.1090/S0025-5718-1984-0736459-9

J. U. Giraud and . Mathématique, Étude locale des singularités, 1971.

J. Giraud, Contact maximal en caract??ristique positive, Annales scientifiques de l'??cole normale sup??rieure, vol.8, issue.2, pp.201-234, 1975.
DOI : 10.24033/asens.1286

]. H. Hir67 and . Hironaka, Characteristic polyhedra of singularities, J. Math. Kyoto Univ, vol.7, pp.251-293, 1967.

]. H. Hir70 and . Hironaka, Additive groups associated with points of a projective space, Ann. of Math, vol.92, issue.2, pp.327-334, 1970.

J. Kollár, Lectures on resolution of singularities, Annals of Mathematics Studies, vol.166, 2007.

D. Lazard, Gr??bner bases, Gaussian elimination and resolution of systems of algebraic equations, Computer algebra, pp.146-156, 1983.
DOI : 10.1007/3-540-12868-9_99

J. Berthomieu, J. Van-der-hoeven, and G. Lecerf, Relaxed algorithms for p-adic numbers, Journal de Th??orie des Nombres de Bordeaux, vol.23, issue.3, pp.541-577, 2011.
DOI : 10.5802/jtnb.777
URL : https://hal.archives-ouvertes.fr/hal-00486680

R. P. Brent and H. T. Kung, Fast Algorithms for Manipulating Formal Power Series, Journal of the ACM, vol.25, issue.4, pp.581-595, 1978.
DOI : 10.1145/322092.322099
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.131.5030

R. P. Brent, The complexity of multiprecision arithmetic, Complexity of computational problem solving, pp.126-165, 1976.

D. V. Chudnovsky, G. V. Chudnovskyck91-]-d, E. Cantor, and . Kaltofen, Computer algebra in the service of mathematical physics and number theory Dekker. 72 Relaxed algorithms for p-adic numbers On fast multiplication of polynomials over arbitrary algebras, Computers in mathematics, pp.109-232693, 1986.

S. and D. Smedt, P -adic arithmetic, The Mathematica Journal, vol.9, issue.2, pp.349-357, 2004.

M. Fürer, Faster Integer Multiplication, Proceedings of the Thirty-Ninth ACM Symposium on Theory of Computing, pp.57-66, 2007.

J. Zur-gathen, Hensel and Newton methods in valuation rings, Mathematics of Computation, vol.42, issue.166, pp.637-661, 1984.
DOI : 10.1090/S0025-5718-1984-0736459-9

J. Zur-gathen and J. Gerhard, Modern computer algebra, 2003.
DOI : 10.1017/CBO9781139856065

T. Granlund, GMP, the GNU multiple precision arithmetic library Available from http, 1991.

W. B. Hart and D. Harvey, FLINT 1.5.1: fast library for number theory Available from http, 2009.

J. Van-der-hoeven, Available from http, 2002.

]. J. Hoe97 and . Van-der-hoeven, Lazy multiplication of formal power series, ISSAC '97: Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, pp.17-20, 1997.

J. Van-der-hoeven, Fast evaluation of holonomic functions, Theoretical Computer Science, vol.210, issue.1, pp.199-215, 1999.
DOI : 10.1016/S0304-3975(98)00102-9
URL : https://hal.archives-ouvertes.fr/hal-01374898

J. Van-der-hoeven, Fast Evaluation of Holonomic Functions Near and in Regular Singularities, Journal of Symbolic Computation, vol.31, issue.6, pp.717-743, 2001.
DOI : 10.1006/jsco.2000.0474

J. Van-der-hoeven, Relax, but Don???t be Too Lazy, Journal of Symbolic Computation, vol.34, issue.6, pp.479-542, 2002.
DOI : 10.1006/jsco.2002.0562

J. Van-der-hoeven, Efficient accelero-summation of holonomic functions, Journal of Symbolic Computation, vol.42, issue.4, pp.389-428, 2007.
DOI : 10.1016/j.jsc.2006.12.005

J. Van-der-hoeven, New algorithms for relaxed multiplication, Journal of Symbolic Computation, vol.42, issue.8, pp.792-802, 2007.
DOI : 10.1016/j.jsc.2007.04.004

J. Van-der-hoeven, Relaxed resolution of implicit equations. Manuscript available from http, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00441977

J. Van-der-hoeven, Newton???s method and FFT trading, Journal of Symbolic Computation, vol.45, issue.8, pp.857-878, 2010.
DOI : 10.1016/j.jsc.2010.03.005

]. S. Kat07 and . Katok, P-adic analysis compared with real , volume 37 of Student Mathematical Library, 2007.

N. Koblitz, P-adic numbers, p-adic analysis, and zeta-functions, volume 58 of Graduate Texts in Mathematics, 1984.

S. Lang, Algebra, volume 211 of Graduate Texts in Mathematics, 2002.

P. The, . Group, . Bordeaux, . Pari, and . Gp, version 2.3.5 . The PARI Group Available from http, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01246385

]. W. So09 and . Stein, The Sage Development Team Available from http, Sage Mathematics Software, 2009.

P. Bürgisser, M. Clausen, and M. A. Shokrollahi, Algebraic complexity theory, of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences, 1997.
DOI : 10.1007/978-3-662-03338-8

J. Berthomieu and R. Lebreton, Relaxed p-adic Hensel lifting for algebraic systems, Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, 2012.
DOI : 10.1145/2442829.2442842
URL : https://hal.archives-ouvertes.fr/hal-00660566

D. Bini and V. Y. Pan, Polynomial and matrix computations, Progress in Theoretical Computer Science, 1994.
DOI : 10.1007/978-1-4612-0265-3

J. Van-der-hoeven, Available from http, 2002.

J. Van-der-hoeven, Relax, but Don???t be Too Lazy, Journal of Symbolic Computation, vol.34, issue.6, pp.479-542, 2002.
DOI : 10.1006/jsco.2002.0562

J. Van-der-hoeven, New algorithms for relaxed multiplication, Journal of Symbolic Computation, vol.42, issue.8, pp.792-802, 2007.
DOI : 10.1016/j.jsc.2007.04.004

J. Van-der-hoeven, Relaxed resolution of implicit equations. Manuscript available from http, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00441977

J. Van-der-hoeven, From implicit to recursive equations. Manuscript available from http, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00583125

A. M. Avendaño, T. Krick, and M. Sombra, Factoring bivariate sparse (lacunary) polynomials, Journal of Complexity, vol.23, issue.2, pp.193-216, 2007.
DOI : 10.1016/j.jco.2006.06.002

]. L. Ber97 and . Bernardin, On square-free factorization of multivariate polynomials over a finite field, Theoret. Comput. Sci. Computer, vol.187, issue.12, pp.105-116, 1996.

]. L. Ber98 and . Bernardin, On bivariate Hensel lifting and its parallelization, ISSAC '98: Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, pp.96-100, 1998.

K. Belabas, M. Van-hoeij, J. Klüners, and A. Steel, Factoring polynomials over global fields, Journal de Th??orie des Nombres de Bordeaux, vol.21, issue.1, pp.15-39, 2009.
DOI : 10.5802/jtnb.655
URL : https://hal.archives-ouvertes.fr/hal-00440300

J. Berthomieu and G. Lecerf, Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations, Mathematics of Computation, vol.81, issue.279, 2010.
DOI : 10.1090/S0025-5718-2011-02562-7
URL : https://hal.archives-ouvertes.fr/hal-00526659

A. Bostan, G. Lecerf, B. Salvy, É. 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

G. Chèze, A recombination algorithm for the decomposition of multivariate rational functions. Manuscript available from http, 2010.

H. S. Coxeter, Introduction to Geometry, 1969.

]. S. Gao03 and . Gao, Factoring multivariate polynomials via partial differential equations, Math. Comp, vol.72, pp.801-822, 2003.

J. Zur-gathen, Factoring sparse multivariate polynomials, 24th Annual IEEE Symposium on Foundations of Computer Science, pp.172-179, 1983.

J. Zur-gathen and J. Gerhard, Modern computer algebra, 2003.
DOI : 10.1017/CBO9781139856065

J. Zur-gathen and E. Kaltofen, Factoring sparse multivariate polynomials, Journal of Computer and System Sciences, vol.31, issue.2, pp.265-287, 1983.
DOI : 10.1016/0022-0000(85)90044-3

V. [. Gao and . Rodrigues, Irreducibility of polynomials modulo p via Newton polytopes, Journal of Number Theory, vol.101, issue.1, pp.32-47, 2003.
DOI : 10.1016/S0022-314X(03)00044-1

B. Grünbaum and G. C. Shephard, Pick's Theorem, The American Mathematical Monthly, vol.100, issue.2, pp.150-161, 1993.
DOI : 10.2307/2323771

J. Van-der-hoeven and G. Lecerf, On the bit-complexity of sparse polynomial and series multiplication. Manuscript available from http, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00476223

E. Kaltofen, Sparse hensel lifting, EUROCAL '85, pp.4-17, 1985.
DOI : 10.1007/3-540-15984-3_230

]. E. Kal89 and . Kaltofen, Factorization of polynomials given by straight-line programs, Randomness and Computation of Advances in Computing Research, pp.375-412, 1989.

E. Kaltofen and P. Koiran, Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields ACM. 114 Reduction of bivariate polynomials from convex-dense to dense [Lec06] G. Lecerf. Sharp precision in Hensel lifting for bivariate polynomial factorization, ISSAC '06: Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, pp.162-168, 2006.

A. M. Ostrowski, Über die Bedeutung der Theorie der konvexen Polyeder für die formale Algebra, Talk given at Der Deutsche Mathematikertag vom, pp.98-99, 1921.

]. A. Ost75 and . Ostrowski, On multiplication and factorization of polynomials. I. Lexicographic orderings and extreme aggregates of terms, Aequationes Math, vol.13, issue.3, pp.201-228, 1975.

]. A. Ost99 and . Ostrowski, On the significance of the theory of convex polyhedra for formal algebra, SIGSAM Bull, vol.33, issue.15, 1999.

A. Poteaux, Calcul de développements de Puiseux et application au calcul du 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, Applicable Algebra in Engineering, Communication and Computing, vol.69, issue.1???2, pp.187-217, 2011.
DOI : 10.1007/s00200-011-0144-6
URL : https://hal.archives-ouvertes.fr/hal-00601438

F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction. Texts and Monographs in Computer Science, 1985.
DOI : 10.1007/978-1-4612-1098-6

J. Serre, A course in arithmetic Translated from the French, Graduate Texts in Mathematics, issue.7, 1973.

]. A. Ste05 and . Steel, Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic, J. Symbolic Comput, vol.40, issue.3, pp.1053-1075, 2005.

M. Weimann, A lifting and recombination algorithm for rational factorization of sparse polynomials, Journal of Complexity, vol.26, issue.6, pp.608-628, 2010.
DOI : 10.1016/j.jco.2010.06.005

]. R. Zip93, . L. Zippelag90-]-e, K. Allgower, and . Georg, Effective Polynomial Computation Bibliography Numerical continuation methods, of Springer Series in Computational Mathematics, 1990.

J. Azaïs and M. Wschebor, On the Roots of a Random System of Equations. The Theorem of Shub and Smale and Some Extensions, Foundations of Computational Mathematics, vol.5, issue.2, pp.125-144, 2005.
DOI : 10.1007/s10208-004-0119-0

P. Bürgisser and F. Cucker, On a problem posed by Steve Smale, Annals of Mathematics, vol.174, issue.3, pp.1785-1836, 2011.
DOI : 10.4007/annals.2011.174.3.8

P. Bürgisser, F. Cucker, and M. Lotz, Smoothed analysis of complex conic condition numbers, Journal de Math??matiques Pures et Appliqu??es, vol.86, issue.4, pp.293-309, 2006.
DOI : 10.1016/j.matpur.2006.06.001

J. Bochnak, M. Coste, and M. Roy, Real Algebraic Geometry, Mathematics and Related Areas, 1998.
DOI : 10.1007/978-3-662-03718-8

F. [. Blum, M. Cucker, S. Shub, and . Smale, Complexity and real computation, 1998.
DOI : 10.1007/978-1-4612-0701-6

C. Beltrán, J. Dedieu, G. Malajovich, and M. Shub, Convexity Properties of the Condition Number, SIAM Journal on Matrix Analysis and Applications, vol.31, issue.3, pp.1491-1506, 2009.
DOI : 10.1137/080718681

C. Beltrán, A continuation method to solve polynomial systems and its complexity, Numerische Mathematik, vol.33, issue.1, pp.89-113, 2011.
DOI : 10.1007/s00211-010-0334-3

B. Bank, M. Giusti, J. Heintz, and M. , On the geometry of polar varieties, Applicable Algebra in Engineering, Communication and Computing, vol.43, issue.2, pp.33-83, 2010.
DOI : 10.1007/s00200-009-0117-1
URL : https://hal.archives-ouvertes.fr/hal-01148162

B. Bank, G. Giusti, J. Heintz, L. Lehmann, and L. M. Pardo, Algorithms of Intrinsic Complexity for Point Searching in Compact Real Singular Hypersurfaces, Foundations of Computational Mathematics, vol.43, issue.118, pp.75-122, 2012.
DOI : 10.1007/s10208-011-9112-6

B. Bank, M. Giusti, J. Heintz, and L. M. Pardo, Generalized polar varieties: geometry and algorithms, Journal of Complexity, vol.21, issue.4, pp.377-412, 2005.
DOI : 10.1016/j.jco.2004.10.001
URL : http://doi.org/10.1016/j.jco.2004.10.001

B. Bank, M. Giusti, J. Heintz, and L. M. Pardo, On the intrinsic complexity of point finding in real singular hypersurfaces, Information Processing Letters, vol.109, issue.19, pp.1141-1144, 2009.
DOI : 10.1016/j.ipl.2009.07.014

C. E. Borges, Programación Genética, Algoritmos Evolutivos y Aprendizaje Inductivo: Hacia una Solución al Problema XVII de Smale en el Caso Real, 2011.

C. Beltrán and L. M. Pardo, On the complexity of non universal polynomial equation solving: old and new results, In Foundations of Computational Mathematics London Math. Soc. Lecture Note Ser, vol.331, pp.1-35, 2005.

C. E. Borges and L. M. Pardo, On the probability distribution of data at points in real complete intersection varieties, Journal of Complexity, vol.24, issue.4, pp.492-523, 2008.
DOI : 10.1016/j.jco.2008.01.001

C. Beltrán and L. M. Pardo, Efficient polynomial system-solving by numerical methods, Journal of Fixed Point Theory and Applications, vol.6, issue.1, pp.63-85, 2009.
DOI : 10.1007/s11784-009-0113-x

C. Beltrán and L. M. Pardo, Smale???s 17th problem: Average polynomial time to compute affine and projective solutions, Journal of the American Mathematical Society, vol.22, issue.2, pp.363-385, 2009.
DOI : 10.1090/S0894-0347-08-00630-9

C. Beltrán and L. M. Pardo, Fast Linear Homotopy to Find Approximate Zeros of??Polynomial Systems, Foundations of Computational Mathematics, vol.25, issue.2, pp.95-129, 2011.
DOI : 10.1007/s10208-010-9078-9

J. Berthomieu and L. M. Pardo, Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian, Journal of Complexity, vol.28, issue.3, 2011.
DOI : 10.1016/j.jco.2011.11.005
URL : https://hal.archives-ouvertes.fr/hal-00612612

S. Basu, R. Pollack, and M. Roy, Algorithms in Real Algebraic Geometry, Algorithms and Computation in Mathematics, vol.10, 2006.
DOI : 10.1007/978-3-662-05355-3
URL : https://hal.archives-ouvertes.fr/hal-01083587

C. Beltrán and M. Shub, Complexity of Bezout???s Theorem VII: Distance Estimates in the Condition Metric, Foundations of Computational Mathematics, vol.33, issue.1, pp.179-195, 2009.
DOI : 10.1007/s10208-007-9018-5

F. [. Bates and . Sottile, Khovanskii???Rolle Continuation for Real Solutions, Foundations of Computational Mathematics, vol.25, issue.2, pp.563-587, 2011.
DOI : 10.1007/s10208-011-9097-1

K. Choi, On the distribution of points in projective space of bounded height, Transactions of the American Mathematical Society, vol.352, issue.03, pp.1071-1111, 2000.
DOI : 10.1090/S0002-9947-99-02275-8

F. Cucker, T. Krick, G. Malajovich, and M. Wschebor, A numerical algorithm for zero counting, I: Complexity and accuracy, Journal of Complexity, vol.24, issue.5-6, pp.5-6582, 2008.
DOI : 10.1016/j.jco.2008.03.001

F. Cucker, T. Krick, G. Malajovich, and M. Wschebor, A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis, Journal of Fixed Point Theory and Applications, vol.6, issue.2, pp.285-294, 2009.
DOI : 10.1007/s11784-009-0127-4

F. Cucker, T. Krick, G. Malajovich, and M. Wschebor, A numerical algorithm for zero counting. III: Randomization and condition, Advances in Applied Mathematics, vol.48, issue.1, 2010.
DOI : 10.1016/j.aam.2011.07.001
URL : http://doi.org/10.1016/j.jco.2008.03.001

M. Demazure, Catastrophes et bifurcations. Les cours de l'École polytechnique, Ellipses, 1989.

J. Dedieu, G. Malajovich, and M. Shub, Adaptative step size selection for homotopy methods to solve polynomial equations. Manuscript available from http, 2011.
DOI : 10.1093/imanum/drs007
URL : http://imajna.oxfordjournals.org/cgi/content/short/33/1/1

J. Dedieu and J. Yakoubsohn, Computing the real roots of a polynomial by the exclusion algorithm, Numerical Algorithms, vol.20, issue.1, pp.1-24, 1993.
DOI : 10.1007/BF02142738

]. H. Fed69 and . Federer, Geometric measure theory. Die Grundlehren der mathematischen Wissenschaften, 1969.

W. Gautschi, Some Elementary Inequalities Relating to the Gamma and Incomplete Gamma Function, Journal of Mathematics and Physics, vol.4, issue.1-4, pp.77-81, 1959.
DOI : 10.1002/sapm195938177

D. Kershaw, Some extensions of W. Gautschi???s inequalities for the gamma function, Mathematics of Computation, vol.41, issue.164, pp.607-611, 1983.
DOI : 10.1090/S0025-5718-1983-0717706-5

T. Y. Li, Numerical solution of polynomial systems by homotopy continuation methods In Handbook of numerical analysis, XI , Handb. Numer. Anal., XI, pp.209-304, 2003.

A. Mclennan, The expected number of real roots of a multihomogeneous system of polynomial equations, American Journal of Mathematics, vol.124, issue.1, pp.49-73, 2002.
DOI : 10.1353/ajm.2002.0005

A. Morgan, Solving polynomial systems using continuation for engineering and scientific problems, 1987.
DOI : 10.1137/1.9780898719031

]. F. Mor09 and . Morgan, Spherical Radon transform and condition number Geometric measure theory, 2009.

L. A. Santaló, Integral geometry and geometric probability. Cambridge Mathematical Library, 2004.

M. Shub, Complexity of Bézout's theorem. VI. Geodesics in the condition (number) metric. Found, Comput. Math, vol.9, issue.2, pp.171-178, 2009.

]. S. Sma00 and . Smale, Mathematical problems for the next century, Mathematics: frontiers and perspectives, pp.271-294, 2000.

M. Shub and S. Smale, Complexity of Bézout's theorem. I. Geometric aspects, J. Amer. Math. Soc, vol.6, issue.2, pp.459-501, 1993.

M. Shub and S. Smale, Complexity of Bézout's theorem. II. Volumes and probabilities, Computational algebraic geometry, pp.267-285, 1992.

M. Shub and S. Smale, Complexity of Bezout???s Theorem IV: Probability of Success; Extensions, SIAM Journal on Numerical Analysis, vol.33, issue.1, pp.128-148, 1996.
DOI : 10.1137/0733008

A. J. Sommese, C. W. Wampler, and I. , The numerical solution of systems of polynomials, Arising in engineering and science, 2005.

M. Wschebor, On the Kostlan???Shub???Smale model for random polynomial systems. Variance of the number of roots, Journal of Complexity, vol.21, issue.6, pp.773-789, 2005.
DOI : 10.1016/j.jco.2005.05.005

J. Bost, H. Gillet, and C. Soulé, Heights of projective varieties and positive Green forms, Journal of the American Mathematical Society, vol.7, issue.4, pp.903-1027, 1994.
DOI : 10.1090/S0894-0347-1994-1260106-X

J. Berthomieu and R. Lebreton, Relaxed p-adic Hensel lifting for algebraic systems, Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, 2011.
DOI : 10.1145/2442829.2442842
URL : https://hal.archives-ouvertes.fr/hal-00660566

C. Beltrán and L. M. Pardo, Efficient polynomial system-solving by numerical methods, Journal of Fixed Point Theory and Applications, vol.6, issue.1, pp.63-85, 2009.
DOI : 10.1007/s11784-009-0113-x

I. S. Cohen, On the structure and ideal theory of complete local rings, Transactions of the American Mathematical Society, vol.59, issue.1, pp.54-106, 1946.
DOI : 10.1090/S0002-9947-1946-0016094-3

O. [. Cossart and . Piltant, Resolution of singularities of threefolds in positive characteristic. I., Journal of Algebra, vol.320, issue.3, pp.1051-1082, 2008.
DOI : 10.1016/j.jalgebra.2008.03.032
URL : https://hal.archives-ouvertes.fr/hal-00139124

O. [. Cossart and . Piltant, Resolution of singularities of threefolds in positive characteristic. I., Journal of Algebra, vol.320, issue.3, pp.1836-1976, 2009.
DOI : 10.1016/j.jalgebra.2008.03.032
URL : https://hal.archives-ouvertes.fr/hal-00139124

]. J. Die68 and . Dieudonné, Calcul infinitésimal, 1968.

]. S. Gao03 and . Gao, Factoring multivariate polynomials via partial differential equations, Math. Comp, vol.72, pp.801-822, 2003.

J. Zur-gathen and J. Gerhard, Modern computer algebra, 2003.
DOI : 10.1017/CBO9781139856065

J. U. Giraud and . Mathématique, Étude locale des singularités, 1971.

J. Giraud, Contact maximal en caract??ristique positive, Annales scientifiques de l'??cole normale sup??rieure, vol.8, issue.2, pp.201-234, 1975.
DOI : 10.24033/asens.1286

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

T. Granlund, GMP, the GNU multiple precision arithmetic library Available from http, 1991.

E. Hallouin, Computing Local Integral Closures, Journal of Symbolic Computation, vol.32, issue.3, pp.211-230, 2001.
DOI : 10.1006/jsco.2001.0447
URL : http://doi.org/10.1006/jsco.2001.0447

H. Hironaka, Resolution of Singularities of an Algebraic Variety Over a Field of Characteristic Zero: II, The Annals of Mathematics, vol.79, issue.2, pp.79-109, 1964.
DOI : 10.2307/1970547

H. Hironaka, Characteristic polyhedra of singularities, Journal of Mathematics of Kyoto University, vol.7, issue.3, pp.251-293, 1967.
DOI : 10.1215/kjm/1250524227

]. H. Hir70 and . Hironaka, Additive groups associated with points of a projective space, Ann. of Math, vol.92, issue.2, pp.327-334, 1970.

J. Van-der-hoeven, Available from http, 2002.

M. Van-hoeij, An Algorithm for Computing an Integral Basis in an Algebraic Function Field, Journal of Symbolic Computation, vol.18, issue.4, pp.353-363, 1994.
DOI : 10.1006/jsco.1994.1051

J. Van-der-hoeven, Lazy multiplication of formal power series, Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97, pp.17-20, 1997.
DOI : 10.1145/258726.258738

J. Van-der-hoeven, Relax, but Don???t be Too Lazy, Journal of Symbolic Computation, vol.34, issue.6, pp.479-542, 2002.
DOI : 10.1006/jsco.2002.0562

T. Krick, L. M. Pardo, and M. Sombra, Sharp estimates for the arithmetic Nullstellensatz, Duke Math. J, vol.109, issue.3, pp.521-598, 2001.

]. S. Lan02 and . Lang, Algebra, volume 211 of Graduate Texts in Mathematics, 2002.

]. D. Mck01 and . Mckinnon, An arithmetic analogue of Bézout's theorem, Compositio Math, vol.126, issue.2, pp.147-155, 2001.

A. M. Ostrowski, Über die Bedeutung der Theorie der konvexen Polyeder für die formale Algebra, Talk given at Der Deutsche Mathematikertag vom, pp.98-99, 1921.

]. A. Ost75 and . Ostrowski, On multiplication and factorization of polynomials. I. Lexicographic orderings and extreme aggregates of terms, Aequationes Math, vol.13, issue.3, pp.201-228, 1975.

]. A. Ost99 and . Ostrowski, On the significance of the theory of convex polyhedra for formal algebra, SIGSAM Bull, vol.33, issue.15, 1999.

]. I. Sha94 and . Shafarevich, Basic algebraic geometry Varieties in projective space, Translated from the, 1988.

M. Shub, Complexity of Bézout's theorem. VI. Geodesics in the condition (number) metric. Found, Comput. Math, vol.9, issue.2, pp.171-178, 2009.

M. Shub and S. Smale, Complexity of Bézout's theorem. I. Geometric aspects, J. Amer. Math. Soc, vol.6, issue.2, pp.459-501, 1993.

M. Shub and S. Smale, Complexity of Bézout's theorem. II. Volumes and probabilities, Computational algebraic geometry, pp.267-285, 1992.
DOI : 10.1006/jcom.1993.1002
URL : http://doi.org/10.1006/jcom.1993.1002

]. B. Tra84 and . Trager, Integration of algebraic functions, 1984.