Complexity and Real Computation, 1998. ,
DOI : 10.1007/978-1-4612-0701-6
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
Completeness and Reduction in Algebraic Complexity Theory. Number 7 in Algorithms and Computation in Mathematics, 2000. ,
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
Lower Bounds Are Not Easier over the Reals: Inside PH, Proc. ICALP 2000, 2000. ,
DOI : 10.1007/3-540-45022-X_70
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.5575
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
Turing machines that take advice. L'enseignement mathématique, pp.191-209, 1982. ,
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
Computing over the reals with addition and order, Theoretical Computer Science, vol.133, issue.1, pp.35-48, 1994. ,
DOI : 10.1016/0304-3975(93)00063-B
Valiant???s Model: From Exponential Sums to Exponential Products, Proc. 31th Mathematical Foundations of Computer Science, 2006. ,
DOI : 10.1007/11821069_52
Straight-line complexity and integer factorization, Proc. First International Symposium on Algorithmic Number Theory, pp.71-79, 1994. ,
DOI : 10.1007/3-540-58691-1_45
Polynômes et coefficients, 2003. ,
Computational Complexity, 1994. ,
Les petits cailloux, Aléas, 1995. ,
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
ON THE INTRACTABILITY OF HILBERT'S NULLSTELLENSATZ AND AN ALGEBRAIC VERSION OF ???NP ??? P????, Duke Math. Journal, vol.81, issue.1, pp.47-54, 1995. ,
DOI : 10.1142/9789812792839_0023
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