1. Aldaz, M., Heintz, J., Matera, G., Montaña, J.L., Pardo, L.M.: Time-space tradeoffs in algebraic complexity theory. Real computation and complexity (Schloss Dagstuhl, 1998). J. Complexity 16(1), 2–49 (2000)
2. Lecture Notes in Computer Science;M. Aldaz,1998
3. Ben-Or, M.: Lower Bounds for Algebraic Computation Trees. In: STOC, pp. 80–86 (1983)
4. Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and real computation. xvi+453 pp. Springer, New York (1998)
5. Blum, L., Shub, M., Smale, S.: On a theory of computation over the real numbers: NP completeness, recursive functions and universal machines [Bull. Amer. Math. Soc (N.S.) 21 (1989), no. 1, 1–46; MR0974426 (90a:68022)]. In: Workshop on Dynamical Systems (Trieste, 1988),pp. 23–52, Pitman Res. Notes Math. Ser. 221, Longman Sci. Tech. Harlow (1990)