On the time complexity of partial real functions

DOI10.1006/jcom.1999.0539zbMath0951.68045OpenAlexW2013798452MaRDI QIDQ1977153

Armin Hemmerling

Publication date: 9 May 2000

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

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

zbMATH Keywords

time complexityKo-Friedman theory

Mathematics Subject Classification ID

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

Related Items

Effective metric spaces and representations of the reals.

Cites Work

• Descriptive set theory
• Computational complexity of real functions
• On approximate and algebraic computability over the real numbers
• Classical recursion theory. Vol. II
• Computable functionals
• Alfred Tarski's elimination theory for real closed fields
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item