scientific article; zbMATH DE number 1303206

MaRDI QIDQ4249729zbMATH OpenFDO

Authors

Publication date 25 June 2000

zbMATH Keywords

surveyrootscomplexity classesintegral equationsintegrationordinary differential equationsrecursive analysiscomputable realscomputable real functionscomplexity theory of real functionscomputability and complexity in analysiscomputable linear operatorscomputational complexity of continuous problems

Mathematics Subject Classification ID

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)

Recommendations

• scientific article; zbMATH DE number 52121
• New Computational Paradigms
• A tutorial on computable analysis
• scientific article; zbMATH DE number 1460545

Cited in

(22)

• Comparing representations for function spaces in computable analysis
• The computational complexity of distance functions of two-dimensional domains
• Polynomial time computation in the context of recursive analysis
• On the computational complexity of the Dirichlet problem for Poisson's equation
• Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
• Computable Carathéodory theory
• Differentiability of polynomial time computable functions
• Selected papers of the 3rd international conference on computability and complexity in analysis, CCA 2006, Gainesville, FL, USA, November 1--5, 2006
• Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
• Proceedings of the 6th workshop on computability and complexity in analysis (CCA 2004), Lutherstadt Wittenberg, Germany, August 16--20, 2004
• In Memoriam: Ker-I Ko (1950–2018)
• On the complexity of computing the Hausdorff distance
• Nondeterministic polynomial-time computations and models of arithmetic
• scientific article; zbMATH DE number 3932433 (Why is no real title available?)
• Handbook of computability and complexity in analysis
• RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMS
• scientific article; zbMATH DE number 4134023 (Why is no real title available?)
• Representations of analytic functions and Weihrauch degrees
• Non-computable Julia sets
• A tutorial on computable analysis
• scientific article; zbMATH DE number 782052 (Why is no real title available?)
• Weihrauch Complexity in Computable Analysis

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)