E. Allender, P. Bürgisser, J. Kjeldgaard-pedersen, and P. Bro-miltersen, On the complexity of numerical analysis, IEEE Conference on Computational Complexity, pp.331-339, 2006.

L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and Real Computation, 1998.
DOI : 10.1007/978-1-4612-0701-6

L. Blum, M. Shub, and S. Smale, On a theory of computation and complexity over the real numbers: $NP$- completeness, recursive functions and universal machines, Bulletin of the American Mathematical Society, vol.21, issue.1, pp.1-46, 1989.
DOI : 10.1090/S0273-0979-1989-15750-9

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

P. Bürgisser, The complexity of factors of multivariate polynomials, Proceedings 2001 IEEE International Conference on Cluster Computing, pp.369-396, 2004.
DOI : 10.1109/SFCS.2001.959912

P. Bürgisser, On defining integers in the counting hierarchy and proving lower bounds in algebraic complexity, Proc. STACS 2007, pp.133-144, 2006.

P. Bürgisser, M. Clausen, and M. A. Shokrollahi, Algebraic Complexity Theory, 1997.
DOI : 10.1007/978-3-662-03338-8

H. Fournier and P. Koiran, Are lower bounds easier over the reals?, Proceedings of the thirtieth annual ACM symposium on Theory of computing , STOC '98, pp.507-513, 1998.
DOI : 10.1145/276698.276864

H. Fournier and P. Koiran, Lower Bounds Are Not Easier over the Reals: Inside PH, Proc. 27th International Colloquium on Automata, Languages and Programming, pp.832-843, 2000.
DOI : 10.1007/3-540-45022-X_70

E. Kaltofen and G. Villard, On the complexity of computing determinants, computational complexity, vol.13, issue.3-4, pp.91-130, 2004.
DOI : 10.1007/s00037-004-0185-3

R. Karp and R. Lipton, Turing machines that take advice, Enseignement Mathématique, vol.28, pp.191-209, 1982.

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 and S. Perifel, Valiant???s Model: From Exponential Sums to Exponential Products, Proc. MFCS, pp.596-607, 2006.
DOI : 10.1007/11821069_52

P. Koiran and S. Perifel, VPSPACE and a Transfer Theorem over the Complex Field, Proc. MFCS 2007, pp.359-370, 2007.
DOI : 10.1007/978-3-540-74456-6_33
URL : https://hal.archives-ouvertes.fr/ensl-00153701

P. Koiran and S. Perifel, VPSPACE and a Transfer Theorem over the Reals, Proc. STACS, pp.417-428, 2007.
DOI : 10.1007/978-3-540-70918-3_36
URL : https://hal.archives-ouvertes.fr/ensl-00103018

G. Malod, The Complexity of Polynomials and Their Coefficient Functions, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), pp.193-204, 2007.
DOI : 10.1109/CCC.2007.33

G. Malod, Polynômes et coefficients Available from http, 2003.

B. Poizat, Les petits cailloux, Aléas, 1995.

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

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