scientific article; zbMATH DE number 4023258

MaRDI QIDQ3765758zbMATH OpenFDO

Authors Norbert Th. Müller

Publication date 1986

zbMATH Keywords

complexitycomputabilitynumerical analysisreal functionsreal numbersrootssubpolynomial hierarchy of real closed fieldstype 2 recursion theory

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 1088269
• scientific article; zbMATH DE number 52121
• Characterizing polynomial time computability of rational and real functions
• On the time complexity of partial real functions
• On the complexity of approximate realization of some classical functions
• Real numbers of sublinear complexity: irrationality and transcendence measures
• Topics in real and complex number complexity theory
• Polynomial time over the reals with parsimony
• scientific article; zbMATH DE number 58287
• scientific article; zbMATH DE number 953024

Cited in

(21)

• On the complexity of online computations of real functions
• A refined model of computation for continuous problems
• Feasible real random access machines
• Online computations of differentiable functions
• Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval
• Computability on computable metric spaces
• Using PVS to validate the algorithms of an exact arithmetic.
• On the time complexity of partial real functions
• Polynomial time over the reals with parsimony
• Type 2 computational complexity of functions on Cantor's space
• Average-case bit-complexity theory of real functions
• Small complexity classes for computable analysis
• Feasible Real Functions and Arithmetic Circuits
• Relativization of Real Numbers to a Universe
• scientific article; zbMATH DE number 1088269 (Why is no real title available?)
• scientific article; zbMATH DE number 2013793 (Why is no real title available?)
• Real numbers and BDDs
• Computability of Real Numbers
• Polynomial time computation in the context of recursive analysis
• The ksmt calculus is a \(\delta \)-complete decision procedure for non-linear constraints
• Quantitative coding and complexity theory of \textit{continuous} data. I: Motivation, definition, consequences

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765758)