scientific article
From MaRDI portal
Publication:3765758
zbMath0629.03023MaRDI QIDQ3765758
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexityrootsreal functionscomputabilitynumerical analysisreal numberssubpolynomial hierarchy of real closed fieldstype 2 recursion theory
Analysis of algorithms and problem complexity (68Q25) 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)
Related Items (12)
The ksmt calculus is a \(\delta \)-complete decision procedure for non-linear constraints ⋮ On the complexity of online computations of real functions ⋮ Real Numbers and BDDs ⋮ Type 2 computational complexity of functions on Cantor's space ⋮ Polynomial time over the reals with parsimony ⋮ Computability on computable metric spaces ⋮ 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 ⋮ Using PVS to validate the algorithms of an exact arithmetic. ⋮ Computability of Real Numbers
This page was built for publication:
