P. Beame, R. Impagliazzo, J. Krají?ek, T. Pitassi, and P. Pudlák, Lower bounds on Hilbert's Nullstellensatz and propositional proofs, Foundations of Computer Science Proceedings ., 35th Annual Symposium on, pp.794-806, 1994.

D. Bernshtein, The number of roots of a system of equations. Functional Analysis and its Applications, pp.183-185, 1975.

B. Bertrand, F. Bihan, and F. Sottile, Polynomial systems with few real zeroes, Mathematische Zeitschrift, vol.253, issue.2, pp.361-385, 2006.
DOI : 10.1007/s00209-005-0912-8
URL : https://hal.archives-ouvertes.fr/hal-00386000

F. Bihan and F. Sottile, New fewnomial upper bounds from Gale dual polynomial systems, Moscow mathematical journal, vol.7, issue.3, pp.387-407, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00380337

W. D. Brownawell, Bounds for the Degrees in the Nullstellensatz, The Annals of Mathematics, vol.126, issue.3, pp.577-591, 1987.
DOI : 10.2307/1971361

J. Canny and I. Emiris, A subdivision-based algorithm for the sparse resultant, Journal of the ACM, vol.47, issue.3, pp.417-451, 2000.
DOI : 10.1145/337244.337247

D. Cifuentes and P. Parrilo, Exploiting chordal structure in polynomial ideals: a Gröbner bases approach. arXiv, abs, 1411.

M. Clegg, J. Edmonds, and R. Impagliazzo, Using the Groebner basis algorithm to find proofs of unsatisfiability, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing , STOC '96, pp.174-183, 1996.
DOI : 10.1145/237814.237860

D. A. Cox, J. B. Little, and H. K. Schenck, Toric varieties, 2011.
DOI : 10.1090/gsm/124

M. Crupi, G. Rinaldo, and N. Terai, Abstract, Nagoya Mathematical Journal, vol.201, pp.117-131, 2011.
DOI : 10.1215/00277630-2010-018

J. Edmonds, Paths, trees, and flowers, Journal canadien de math??matiques, vol.17, issue.0, pp.449-467, 1965.
DOI : 10.4153/CJM-1965-045-4

P. Erdös and A. Rényi, On the evolution of random graphs, Publ. Math. Inst. Hung. Acad. Sci, vol.5, pp.17-61, 1960.

J. Faugère, P. Spaenlehauer, and J. Svartz, Sparse Gröbner bases: the unmixed case, Proceedings of ISSAC 2014, 2014.

N. Fitchas and A. Galligo, Nullstellensatz effectif et Conjecture de Serre (Th??or??me de Quillen-Suslin) pour le Calcul Formel, Mathematische Nachrichten, vol.51, issue.1, pp.231-253, 1990.
DOI : 10.1002/mana.19901490118

R. Fröberg, On Stanley-Reisner rings, Banach Center Publications, vol.26, issue.2, pp.57-70, 1990.

J. Herzog and T. Hibi, Distributive Lattices, Bipartite Graphs and Alexander Duality, Journal of Algebraic Combinatorics, vol.278, issue.7, pp.289-302, 2005.
DOI : 10.1007/s10801-005-4528-1

J. Herzog, T. Hibi, and X. Zheng, Monomial ideals whose powers have a linear resolution, MATHEMATICA SCANDINAVICA, vol.95, issue.1, pp.23-32, 2004.
DOI : 10.7146/math.scand.a-14446

B. Huber and B. Sturmfels, A polyhedral method for solving sparse polynomial systems, Mathematics of Computation, vol.64, issue.212, pp.1541-1555, 1995.
DOI : 10.1090/S0025-5718-1995-1297471-4

A. Khovanskii, On a class of systems of transcendental equations, Soviet Mathematics Doklady, vol.22, issue.3, pp.762-765, 1980.

P. Koiran, N. Portier, and S. Tavenas, On the Intersection of a Sparse Curve and a Low-Degree Curve: A Polynomial Version of the Lost Theorem, Discrete & Computational Geometry, vol.14, issue.3, pp.48-63, 2015.
DOI : 10.1007/s00454-014-9642-1
URL : https://hal.archives-ouvertes.fr/ensl-00871315

P. Koiran, N. Portier, S. Tavenas, and S. Thomassé, A $$\tau $$ ?? -Conjecture for Newton Polygons, Foundations of Computational Mathematics, vol.15, issue.1, pp.1-13, 2014.
DOI : 10.1007/s10208-014-9216-x
URL : https://hal.archives-ouvertes.fr/ensl-00850791

J. Kollár, Sharp Effective Nullstellensatz, Journal of the American Mathematical Society, vol.1, issue.4, pp.963-975, 1988.
DOI : 10.2307/1990996

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

A. G. Kushnirenko, Newton polytopes and the Bezout theorem. Functional Analysis and its Applications, pp.233-235, 1976.

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.

F. and L. Gall, Powers of tensors and fast matrix multiplication, Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ISSAC '14, 2014.
DOI : 10.1145/2608628.2608664

L. Lovász and M. D. Plummer, Matching theory, 1986.
DOI : 10.1090/chel/367

E. Miller and B. Sturmfels, Combinatorial commutative algebra, 2005.

I. Semaev, On solving sparse algebraic equations over finite fields. Designs, Codes and Crypto, pp.47-60, 2008.

M. Shub and S. Smale, ON THE INTRACTABILITY OF HILBERT'S NULLSTELLENSATZ AND AN ALGEBRAIC VERSION OF ???NP ??? P????, P= NP " . Duke Mathematical Journal, vol.81, issue.1, pp.47-54, 1996.
DOI : 10.1142/9789812792839_0023

M. Sombra, A Sparse Effective Nullstellensatz, Advances in Applied Mathematics, vol.22, issue.2, pp.271-295, 1999.
DOI : 10.1006/aama.1998.0633

A. Storjohann, Algorithms for matrix canonical forms, 2000.

B. Sturmfels, Sparse elimination theory, Proceedings of Computational Algebraic Geometry and Commutative Algebra, pp.377-396, 1991.

B. Sturmfels, Gröbner bases and convex polytopes, 1996.
DOI : 10.1090/ulect/008

J. Verschelde, P. Verlinden, and R. Cools, Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems, SIAM Journal on Numerical Analysis, vol.31, issue.3, pp.915-930, 1994.
DOI : 10.1137/0731049

R. Woodroofe, Matchings, coverings, and Castelnuovo-Mumford regularity, Journal of Commutative Algebra, vol.6, issue.2, pp.287-304, 2014.
DOI : 10.1216/JCA-2014-6-2-287
URL : http://arxiv.org/abs/1009.2756