N. Alon and J. Spencer, The Probabilistic Method (second edition) Wiley Interscience Series in Discrete Mathematics and Optimization, 2000.

P. Clote and E. Kranakis, Boolean Functions and Computation Models. Texts in Theoretical Computer Science (an EATCS Series), 2002.

W. Eberly, Very Fast Parallel Polynomial Arithmetic, SIAM Journal on Computing, vol.18, issue.5, pp.955-976, 1989.
DOI : 10.1137/0218066

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

D. Grigoriev, Topological Complexity of the Range Searching, Journal of Complexity, vol.16, issue.1, pp.50-53, 2000.
DOI : 10.1006/jcom.1999.0527

P. Koiran, Circuits versus Trees in Algebraic Complexity, Proc. STACS, pp.35-52, 2000.
DOI : 10.1007/3-540-46541-3_3

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

S. Meiser, Point location in arrangements of hyperplanes. Information and Computation, pp.286-303, 1993.

F. Meyer-auf-der-heide, A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem, Journal of the ACM, vol.31, issue.3, pp.668-676, 1984.
DOI : 10.1145/828.322450

F. Meyer-auf-der-heide, Fast algorithms for N-dimensional restrictions of hard problems, Journal of the ACM, vol.35, issue.3, pp.740-747, 1988.
DOI : 10.1145/44483.44490

R. Motwani, J. Naor, and M. Naor, The probabilistic method yields deterministic parallel algorithms, Journal of Computer and System Sciences, vol.49, issue.3, pp.478-516, 1994.
DOI : 10.1016/S0022-0000(05)80069-8

J. Riordan, Combinatorial Identities, 1979.

S. Smale, On the topology of algorithms, I, Journal of Complexity, vol.3, issue.2, pp.81-89, 1987.
DOI : 10.1016/0885-064X(87)90021-5

R. Sprugnoli, Combinatorial Identities, 2004.
URL : https://hal.archives-ouvertes.fr/hal-01184212

V. A. Vassiliev, On decision trees for orthants, Information Processing Letters, vol.62, issue.5, pp.265-268, 1997.
DOI : 10.1016/S0020-0190(97)00073-2

H. Vollmer, Introduction to Circuit Complexity: a Uniform Approach. Texts in Theoretical Computer Science (an EATCS Series), 1999.
DOI : 10.1007/978-3-662-03927-4