M. Agrawal and R. Saptharishi, Classifying Polynomials and Identity Testing, Current Trends in Science, 2009.

M. Agrawal and V. Vinay, Arithmetic Circuits: A Chasm at Depth Four, 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pp.67-75, 2008.
DOI : 10.1109/FOCS.2008.32

E. Allender, P. Bürgisser, J. Kjeldgaard-pedersen, and P. Bro-miltersen, On the Complexity of Numerical Analysis, SIAM Journal on Computing, vol.38, issue.5, pp.1987-2006, 2006.
DOI : 10.1137/070697926

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, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00380337

M. Bläser, M. Hardt, R. J. Lipton, and N. K. Vishnoi, Deterministically testing sparse polynomial identities of unbounded degree, Information Processing Letters, vol.109, issue.3, pp.187-192, 2009.
DOI : 10.1016/j.ipl.2008.09.029

A. Borodin and S. Cook, On the Number of Additions to Compute Specific Polynomials, SIAM Journal on Computing, vol.5, issue.1, pp.146-157, 1976.
DOI : 10.1137/0205013

P. Bürgisser, Completeness and Reduction in Algebraic Complexity Theory. Number 7 in Algorithms and Computation in Mathematics, 2000.

P. Bürgisser, On Defining Integers And Proving Arithmetic Circuit Lower Bounds, computational complexity, vol.18, issue.1, pp.81-103, 2007.
DOI : 10.1007/s00037-009-0260-x

J. Heintz and C. Schnorr, Testing polynomials which are easy to compute Monographie n o 30 de L'Enseignement Mathématique, Logic and Algorithmic (an International Symposium held in honour of Ernst Specker) Preliminary version in Proc. 12th ACM Symposium on Theory of Computing, pp.237-254, 1980.
DOI : 10.1145/800141.804674

V. Kabanets and R. Impagliazzo, Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds, computational complexity, vol.13, issue.1-2, pp.1-46, 2004.
DOI : 10.1007/s00037-004-0182-6

]. R. Karp and R. Lipton, Turing machines that take advice

A. G. Khovanskii, Fewnomials, volume 88 of Translations of Mathematical Monographs, 1991.

P. Koiran, Arithmetic circuits: The chasm at depth four gets wider, Theoretical Computer Science, vol.448
DOI : 10.1016/j.tcs.2012.03.041
URL : https://hal.archives-ouvertes.fr/ensl-00494642

P. Koiran, Valiant?s model and the cost of computing integers, computational complexity, vol.13, issue.3-4, pp.131-146, 2004.
DOI : 10.1007/s00037-004-0186-2

P. Koiran, A hitting set construction, with application to arithmetic circuit lower bounds, p.5575, 2009.
URL : https://hal.archives-ouvertes.fr/ensl-00408713

P. Koiran and S. Perifel, Interpolation in Valiant's theory To appear in Computational Complexity Available from http, 2007.

P. Koiran and S. Perifel, VPSACE and a transfer theorem over the complex field, Proc. 32nd International Symposium on Mathematical Foundations of Computer Science, pp.359-370, 2007.

P. Koiran and S. Perifel, VPSPACE and a Transfer Theorem over the Reals, computational complexity, vol.18, issue.4, pp.551-575, 2007.
DOI : 10.1007/s00037-009-0269-1
URL : https://hal.archives-ouvertes.fr/ensl-00103018

T. Li, J. M. Rojas, and X. Wang, Counting Real Connected Components of Trinomial Curve Intersections and m -nomial Hypersurfaces, Discrete and Computational Geometry, vol.30, issue.3, pp.379-414, 2003.
DOI : 10.1007/s00454-003-2834-8

M. Mahajan and R. Rao, Small-Space Analogues of Valiant???s Classes, Proc. 17th International Symposium on Fundamentals of Computation Theory, pp.250-261, 2009.
DOI : 10.1007/978-3-642-03409-1_23

G. Malod, Polynômes et coefficients, 2003.

B. Poizat, R??sum??, The Journal of Symbolic Logic, vol.13, issue.04, pp.1179-1201, 2008.
DOI : 10.1145/321958.321973

N. Saxena, Progress on Polynomial Identity Testing-II, Bull. EATCS, vol.99, pp.49-79, 2009.
DOI : 10.1007/978-3-319-05446-9_7
URL : http://arxiv.org/abs/1401.0976

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

S. Smale, Mathematical problems for the next century, The Mathematical Intelligencer, vol.50, issue.2, pp.7-15, 1998.
DOI : 10.1007/BF03025291

L. G. Valiant, Completeness classes in algebra, Proceedings of the eleventh annual ACM symposium on Theory of computing , STOC '79, pp.249-261, 1979.
DOI : 10.1145/800135.804419

K. W. Wagner, The complexity of combinatorial problems with succinct input representation, Acta Informatica, vol.3, issue.3, pp.325-356, 1986.
DOI : 10.1007/BF00289117