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

R. Beigel and J. Gill, Counting classes: thresholds, parity, mods, and fewness, Theoretical Computer Science, vol.103, issue.1, pp.3-23, 1992.
DOI : 10.1016/0304-3975(92)90084-S
URL : http://1013seopc.eecs.uic.edu/papers/bg-mods-tcs.PS.gz

P. Bürgisser, Completeness and Reduction in Algebraic Complexity Theory, Algorithms and Computation in Mathematics, vol.7, 2000.
DOI : 10.1007/978-3-662-04179-6

P. Bürgisser, On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds, Proc. STACS Electronic Colloquium on Computational Complexity, pp.133-144, 2006.
DOI : 10.1007/978-3-540-70918-3_12

A. Lane, M. Hemaspaandra, and . Ogihara, The Complexity Theory Companion . Texts in Theoretical Computer Science (An EATCS Series), 2002.

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

E. Kaltofen, Greatest common divisors of polynomials given by straight-line programs, Journal of the ACM, vol.35, issue.1, pp.231-264, 1988.
DOI : 10.1145/42267.45069

T. J. Long, Strong nondeterministic polynomial-time reducibilities, Théorie des fonctions numériques simplement périodiques, pp.1-25184, 1878.
DOI : 10.1016/0304-3975(82)90085-8
URL : http://doi.org/10.1016/0304-3975(82)90085-8

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

G. Malod and N. Portier, Characterizing Valiant???s Algebraic Complexity Classes, In Mathematical Foundations of Computer Science Lecture Notes in Computer Science, vol.4162, pp.704-716, 2006.
DOI : 10.1007/11821069_61
URL : http://doi.org/10.1016/j.jco.2006.09.006

G. L. Miller, V. Ramachandran, and E. Kaltofen, Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits, SIAM Journal on Computing, vol.17, issue.4, pp.687-695, 1988.
DOI : 10.1137/0217044

H. Chistos and . Papadimitriou, Computational Complexity, 1994.

J. T. Schwartz, Fast Probabilistic Algorithms for Verification of Polynomial Identities, Journal of the ACM, vol.27, issue.4, pp.701-717, 1980.
DOI : 10.1145/322217.322225

S. Toda, On the computational power of PP and (+)P, 30th Annual Symposium on Foundations of Computer Science, pp.514-519, 1989.
DOI : 10.1109/SFCS.1989.63527

S. Toda and M. Ogiwara, Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy, SIAM Journal on Computing, vol.21, issue.2, pp.316-328, 1992.
DOI : 10.1137/0221023

G. Leslie and . Valiant, Completeness classes in algebra, Proc. 11th STOC, pp.249-261, 1979.

G. Leslie and . Valiant, The complexity of computing the permanent, Theoretical Computer Science, vol.8, issue.2, pp.189-201, 1979.

G. Leslie and . Valiant, The complexity of enumeration and reliability problems, SIAM Journal on Computing, vol.8, pp.410-421, 1979.