P. K. Agarwal and J. Matou, On range searching with semialgebraic sets, Discrete and Computational Geometry, vol.11, issue.4, pp.393-418
DOI : 10.1007/3-540-55808-x_1

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

L. Blum, F. Cucker, M. Shub, and S. Smale, Algebraic settings for the problem \P6 =NP?, The Mathematics of Numerical Analysis, pp.1-9
DOI : 10.1142/9789812792839_0025

L. Blum, M. Shub, and S. Smale, On a theory of computation and complexity o ver the real numbers: NP-completeness, recursive functions and universal machines, Bulletin of the American Mathematical Society, vol.21, issue.1, pp.1-46, 1989.

P. Urgisser, T. Lickteig, and M. Shub, Test complexity of generic polynomials, Journal of Complexity, vol.8, pp.203-215, 1992.

B. Chazelle, Cutting hyperplanes for divide-and-conquer, vol.9, pp.145-158, 1993.
DOI : 10.1007/bf02189314
URL : https://link.springer.com/content/pdf/10.1007%2FBF02189314.pdf

F. Cucker and P. Koiran, Computing over the reals with addition and order: Higher complexity classes, Journal of Complexity, vol.11, pp.358-376, 1995.

D. Dobkin and R. J. Lipton, A lower bound of (1=2)n 2 on linear search programs for the knapsack problem, Journal of Computer and System Sciences, vol.16, pp.413-417, 1978.

H. Fournier, Localisation de points dans un arrangement d ' h yperplans par un arbre de d ecision, 1997.

P. Koiran, 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
URL : https://doi.org/10.1016/0304-3975(93)00063-b

P. Koiran, A weak version of the Blum, Shub & Smale model, Journal of Computer and System Sciences, vol.54, pp.177-189, 1997.

K. Meer, A note on a P 6 =NPresult for a restricted class of real machines, Journal of Complexity, vol.8, pp.451-453, 1992.

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

F. Meyer and H. Der, A polynomial linear search algorithm for the n-dimensional knapsack problem, A CM, vol.31, issue.3, pp.668-676, 1984.

F. Meyer and H. Der, Fast algorithms for n-dimensional restrictions of hard problems, Journal of the ACM, vol.35, issue.3, pp.740-747, 1988.

M. Shub and S. Smale, On the intractability of Hilbert's Nullstellensatz and an algebraic version of \P=NP, Duke Mathematical Journal, vol.81, issue.1, pp.47-54, 1996.

S. Smale, On the topology of algorithms. I, Journal of Complexity, vol.3, pp.81-89, 1987.

J. M. Steele and A. Yao, Lower bounds for algebraic decision trees, Journal of Algorithms, vol.3, pp.1-8, 1982.

V. A. Vassiliev, Complements of Discriminants of Smooth Maps: Topology and Applications. Translations of Mathematical Monographs 98, 1994.
DOI : 10.1090/mmono/098

A. Yao, On parallel computation for the knapsack problem, Journal of the ACM, vol.29, issue.3, pp.898-903, 1982.