1. Aho, A., Hopcroft, J., Ullman J.: The Design and Analysis of Computer Algorithms. Toronto: Addison-Wesley 1976
2. Ben-Or, M.: Lower bounds for algebraic computation trees. A.C.M. 15th Symp Theory Comput., pp. 80?86 (1983)
3. Benedetti, R., Risler, J. J.: Real algebraic and semialgebraic sets. Paris: Hermann 1990
4. Blum, L., Shub, M., Smale S.: On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bull. Am. Math. Soc.21(1), 1?46 (1989)
5. Bochnak, J., Coste, M., Roy, M.-F.: Géométrie algébrique réelle. Ergebnisse der Math., 3. Folge, Bd. 12. Berlin Heidelberg New York: Springer 1987