F. A. Salem, S. Gao, and A. G. Lauder, Factoring polynomials via polytopes, pp.4-11, 2004.

D. N. Bernstein, The number of roots of a system of equations, Funkcional. Anal. i Prilo?en, vol.9, pp.1-4, 1975.

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

G. Chèze, Absolute polynomial factorization in two variables and the knapsack problem, Proceedings of the 2004 international symposium on Symbolic and algebraic computation , ISSAC '04, pp.87-94, 2004.
DOI : 10.1145/1005285.1005300

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 and G. Lecerf, Lifting and recombination techniques for absolute factorization, Journal of Complexity, vol.23, issue.3, pp.380-420, 2007.
DOI : 10.1016/j.jco.2007.01.008

D. A. Cox, Erratum to ???The homogeneous coordinate ring of a toric variety???, Journal of Algebraic Geometry, vol.23, issue.2, pp.17-50, 1995.
DOI : 10.1090/S1056-3911-2013-00651-7

I. Z. Emiris, On the Complexity of Sparse Elimination, Journal of Complexity, vol.12, issue.2, pp.134-166, 1996.
DOI : 10.1006/jcom.1996.0010

W. Fulton, Introduction to toric varieties, Annals of Mathematics Studies, vol.131, 1993.

S. Gao, Absolute Irreducibility of Polynomials via Newton Polytopes, Journal of Algebra, vol.237, issue.2, pp.501-520, 2001.
DOI : 10.1006/jabr.2000.8586

P. Griffiths and J. Harris, Principles of algebraic geometry, 1978.
DOI : 10.1002/9781118032527

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

A. M. Ostrowski, On multiplication and factorization of polynomials, I. Lexicographic orderings and extreme aggregates of terms, Aequationes Mathematicae, vol.13, issue.3, pp.201-228, 1975.
DOI : 10.1007/BF01836524

D. Rupprecht, Semi-numerical absolute factorization of polynomials with integer coefficients, Journal of Symbolic Computation, vol.37, issue.5, pp.557-574, 2004.
DOI : 10.1016/S0747-7171(02)00011-1

T. Sasaki, M. Suzuki, M. Kolá?, and M. Sasaki, Approximate factorization of multivariate polynomials and absolute irreducibility testing, Japan Journal of Industrial and Applied Mathematics, vol.1, issue.3, pp.357-375, 1991.
DOI : 10.1007/BF03167142

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

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

M. Weimann, Un th??or??me d???interpolation dans les vari??t??s toriques, Annales de l???institut Fourier, vol.58, issue.4, 2007.
DOI : 10.5802/aif.2387

J. A. Wood, A simple criterion for local hypersurfaces to be algebraic, Duke Math, J, vol.51, pp.235-237, 1984.