T. Baker, J. Gill, and R. Solovay, Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question, SIAM Journal on Computing, vol.4, issue.4, pp.431-442, 1975.
DOI : 10.1137/0204037

S. Ben-david, K. Meer, and C. Michaux, A note on non-complete problems in NP R , Preprint, 1996.

C. H. Bennett and J. Gill, , ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1, SIAM Journal on Computing, vol.10, issue.1, pp.96-113, 1981.
DOI : 10.1137/0210008

L. Blum, F. Cucker, M. Shub, and S. Smale, Algebraic Settings for the Problem " P ? ? NP?, The mathematics of numerical analysis, number 32 in Lectures in Applied Mathematics, pp.125-144, 1996.

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, 1998.
DOI : 10.1007/978-3-662-04179-6

P. Bürgisser, Cook's versus Valiant's hypothesis, Theoret. Comp. Sci

P. Bürgisser, M. Clausen, and M. A. Shokrollahi, Algebraic Complexity Theory, Number 315 in Grundlehren der mathematischen Wissenschaften, 1997.

J. Cai and L. A. Hemachandra, On the power of parity polynomial time, Proc. STACS'89, number 349 in LNCS, pp.229-239, 1989.

O. Chapuis and P. Koiran, Saturation and Stability in the Theory of Computation over the Reals, Annals of Pure and Applied Logic

S. A. Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , STOC '71, pp.151-158, 1971.
DOI : 10.1145/800157.805047

T. Emerson, Relativizations of the P=?NP question over the reals (and other ordered rings), Theoret. Comp. Sci, pp.15-22, 1994.
DOI : 10.1016/0304-3975(94)00068-9

W. Feller, An introduction to probability theory and its applications, 1971.

J. Zur-gathen, Feasible arithmetic computations: Valiant's hypothesis, Journal of Symbolic Computation, vol.4, issue.2, pp.137-172, 1987.
DOI : 10.1016/S0747-7171(87)80063-9

J. Heintz and J. Morgenstern, On the Intrinsic Complexity of Elimination Theory, Journal of Complexity, vol.9, issue.4, pp.471-498, 1993.
DOI : 10.1006/jcom.1993.1031
URL : https://hal.archives-ouvertes.fr/inria-00074751

R. M. Karp and R. J. Lipton, Turing machines that take advice, Logic and Algorithmic: An international Symposium held in honor of Ernst Specker, pp.255-273, 1982.

R. E. Ladner, On the Structure of Polynomial Time Reducibility, Journal of the ACM, vol.22, issue.1, pp.155-171, 1975.
DOI : 10.1145/321864.321877

L. Landweber and R. , On the structure of sets in NP and other complexity classes, Theoretical Computer Science, vol.15, issue.2, pp.181-200, 1981.
DOI : 10.1016/0304-3975(81)90069-4

C. H. Papadimitriou and S. Zachos, Two remarks on the power of counting, Proc. 6th GI conference in Theoretical Computer Science, number 145, pp.269-276, 1983.
DOI : 10.1007/BFb0009651

U. Schöning, A uniform approach to obtain diagonal sets in complexity classes, Theoretical Computer Science, vol.18, issue.1, pp.95-103, 1982.
DOI : 10.1016/0304-3975(82)90114-1

S. Smale, Complexity theory and numerical analysis, Acta Numerica, vol.463, issue.2, pp.523-551, 1997.
DOI : 10.1137/0703023

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

L. G. Valiant, The complexity of computing the permanent, Theoretical Computer Science, vol.8, issue.2, pp.189-201, 1979.
DOI : 10.1016/0304-3975(79)90044-6

L. G. Valiant, Reducibility by algebraic projections, Logic and Algorithmic: an International Symposium held in honor of Ernst Specker, pp.365-380, 1982.

L. G. Valiant and V. V. Vazirani, NP is as easy as detecting unique solutions, Theoretical Computer Science, vol.47, pp.85-93, 1986.
DOI : 10.1016/0304-3975(86)90135-0