Feasible real random access machines

Journal of Complexity

Volumn 14, Issue 4, 1998, Pages 490-526

  Brattka, Vasco ^a   Hertling, Peter ^b  

^a UNIVERSITY OF HAGEN   (Germany)

^b UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Computational complexity; computability; complexity in analysis

Indexed keywords

EID: 0040684164     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.1998.0488     Document Type: Article

References (26)

1. Avizienis A. Signed-digit number representations for fast parallel arithmetic. IRE Trans. Electron. Comput. EC-10:1961;389-400.
2. Blum L., Shub M., Smale S. On a theory of computation and complexity over the real numbers:NP. Bull. of the Amer. Math. Soc. 21:1989;1-46.
3. Boldi P., Vigna S. δ J. Complexity. 14:1998;234-256.
4. Brattka V. Recursive characterization of computable real-valued functions and relations. Theor. Comput. Sci. 162:1996;45-77.
5. Brent R. P. Fast multiple-precision evaluation of elementary functions. J. Assoc. Comput. Mach. 23:1976;242-251.
6. Burnikel C., Mehlhorn K., Schirra S. On degeneracy in geometric computations. Proc. of the 5th ACM-SIAM Symp. on Discrete Algorithms, 1994. 1994;. p. 16-23.
7. Grzegorczyk A. On the definition of computable real continuous functions. Fund. Math. 44:1957;61-71.
8. Hertling P., Weihrauch K. Levels of degeneracy and exact lower complexity bounds for geometric algorithms. Proc. of the Sixth Can. Conf. on Comp. Geometry, 1994. 1994;. p. 237-242.
9. Hotz G., Vierke G., Schieffer B. Analytic machines, Electronic Colloquium on Computational Complexity. TR. 1995.
10. Ko K.-I. Complexity Theory of Real Functions. 1991;Birkhäuser, Boston.
11. Koiran P. A weak version of the Blum-Shub-Smale model. Proc. 34th IEEE Symposium on Foundations of Computer Science, 1993. 1993;. p. 486-495.
12. Lacombe D. Extension de la notion de fonction récursive aux fonctions d'une ou plusieurs variables réelles I-III. Comptes Rendus. 240/241:1955;2478-2480.
13. Meyer auf der Heide, F. Wiedermann, J. Numerical RAM: A realistic machine model for scientific computing.
14. Müller N. Th. Computational complexity of real functions and real numbers. Informatik Berichte. 1986.
15. Müller N. Th. Towards a real Real RAM: a Prototype using C++. Proc. of the Second CCA Workshop. Forschungsbericht. 96-44:1996;Universität Trier. p. 59-66.
16. Novak E. The real number model in numerical analysis. J. Complexity. 11:1995;57-73.
17. Pour-El M. B., Richards J. Computability in Analysis and Physics. 1989;Springer-Verlag, Berlin.
18. Preparata F., Shamos M. Computational Geometry. 1985;Springer-Verlag, New York.
19. Schönhage A. Quasi-GCD computations. J. Complexity. 1:1985;118-137.
20. Schröder M. Topological spaces allowing Type 2 complexity theory. Ko K.-I., Weihrauch K. Proc. of the CCA Workshop. Informatik Berichte 190. 1995;41-53 FernUniversität, Hagen.
21. Schröder M. Fast online multiplication of real numbers. Proc. of the 14th Annual Symposium on Theoretical Aspects of Computer Science. LNCS 1200. 1997;Springer-Verlag, Berlin. p. 81-92.
22. Traub J., Wasilkowski G., Woźniakowski H. Information-Based Complexity. 1988;Academic Press, New York.
23. Weihrauch K. Computability. 1987;Springer-Verlag, Berlin.
24. Weihrauch K. On the complexity of online computations of real functions. J. Complexity. 7:1991;380-394.
25. Weihrauch K., Kreitz Ch. Type 2 computational complexity of functions on Cantor's space. Theor. Comput. Sci. 82:1991;1-18.
26. Weihrauch K. A Simple Introduction to Computable Analysis. Informatik Berichte 171. 1995;FernUniversität, Hagen.