Feasible real random access machines

DOI10.1006/jcom.1998.0488zbMath0913.68099MaRDI QIDQ1279912

Vasco Brattka, Peter H. Hertling

Publication date: 13 June 1999

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.1998.0488

zbMATH Keywords

computational complexity

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

Related Items

Stability versus speed in a computable algebraic model, On approximate and algebraic computability over the real numbers, Recursive characterization of computable real-valued functions and relations, The Turing closure of an Archimedean field, Arbitrary precision real arithmetic: design and algorithms, Motivations for an arbitrary precision interval arithmetic and the MPFI library

Cites Work

• Quasi-gcd computations
• On the complexity of online computations of real functions
• \(\delta\)-uniform BSS machines
• The real number model in numerical analysis
• Recursive characterization of computable real-valued functions and relations
• Type 2 computational complexity of functions on Cantor's space
• On the definitions of computable real continuous functions
• Fast Multiple-Precision Evaluation of Elementary Functions
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Fast online multiplication of real numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item