scientific article; zbMATH DE number 1303206

zbMath0938.03090MaRDI QIDQ4249729

No author found.

Publication date: 25 June 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

surveyrootscomputable realsordinary differential equationsintegral equationsintegrationrecursive analysiscomplexity classescomputable 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) Constructive and recursive analysis (03F60) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (9)

Comparing representations for function spaces in computable analysis ⋮ On the computational complexity of the Dirichlet Problem for Poisson's Equation ⋮ Computable Carathéodory theory ⋮ On the complexity of computing the Hausdorff distance ⋮ In Memoriam: Ker-I Ko (1950–2018) ⋮ Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy ⋮ Representations of Analytic Functions and Weihrauch Degrees ⋮ The computational complexity of distance functions of two-dimensional domains ⋮ Non-computable Julia sets

This page was built for publication: