scientific article; zbMATH DE number 1303206
zbMATH Open0938.03090MaRDI QIDQ4249729FDOQ4249729
Authors:
Publication date: 25 June 2000
Title of this publication is not available (Why is that?)
Recommendations
surveyrootscomplexity classesintegral equationsintegrationordinary differential equationsrecursive analysiscomputable realscomputable real functionscomplexity theory of real functionscomputability and complexity in analysiscomputable linear operatorscomputational complexity of continuous problems
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15) Constructive and recursive analysis (03F60)
Cited In (22)
- RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMS
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- The computational complexity of distance functions of two-dimensional domains
- On the computational complexity of the Dirichlet problem for Poisson's equation
- Comparing representations for function spaces in computable analysis
- Computable Carathéodory theory
- Differentiability of polynomial time computable functions
- Representations of analytic functions and Weihrauch degrees
- A tutorial on computable analysis
- Proceedings of the 6th workshop on computability and complexity in analysis (CCA 2004), Lutherstadt Wittenberg, Germany, August 16--20, 2004
- Nondeterministic polynomial-time computations and models of arithmetic
- Title not available (Why is that?)
- In Memoriam: Ker-I Ko (1950–2018)
- Non-computable Julia sets
- Title not available (Why is that?)
- Weihrauch Complexity in Computable Analysis
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- Handbook of computability and complexity in analysis
- Title not available (Why is that?)
- Polynomial time computation in the context of recursive analysis
- Selected papers of the 3rd international conference on computability and complexity in analysis, CCA 2006, Gainesville, FL, USA, November 1--5, 2006
- On the complexity of computing the Hausdorff distance
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 Q4249729)
