scientific article; zbMATH DE number 4023258
From MaRDI portal
Publication:3765758
zbMATH Open0629.03023MaRDI QIDQ3765758FDOQ3765758
Authors: Norbert Th. Müller 
Publication date: 1986
Title of this publication is not available (Why is that?)
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
complexityrootsnumerical analysisreal functionscomputabilityreal numberssubpolynomial hierarchy of real closed fieldstype 2 recursion theory
Analysis of algorithms and problem complexity (68Q25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Complexity of computation (including implicit computational complexity) (03D15) Higher-type and set recursion theory (03D65)
Cited In (19)
- Small complexity classes for computable analysis
- Title not available (Why is that?)
- Computability on computable metric spaces
- Online computations of differentiable functions
- On the time complexity of partial real functions
- A refined model of computation for continuous problems
- Real numbers and BDDs
- Average-case bit-complexity theory of real functions
- Relativization of Real Numbers to a Universe
- The ksmt calculus is a \(\delta \)-complete decision procedure for non-linear constraints
- Using PVS to validate the algorithms of an exact arithmetic.
- Feasible real random access machines
- Feasible Real Functions and Arithmetic Circuits
- On the complexity of online computations of real functions
- Polynomial time computation in the context of recursive analysis
- Type 2 computational complexity of functions on Cantor's space
- Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval
- Polynomial time over the reals with parsimony
- Computability of Real Numbers
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)
