Quantitative coding and complexity theory of compact metric spaces
From MaRDI portal
Publication:2106606
Recommendations
Cites work
- A fundamental effect in computations on real numbers
- A new Characterization of Type-2 Feasibility
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- Complexity theory for operators in analysis
- Complexity theory for spaces of integrable functions
- Complexity theory of (functions on) compact metric spaces
- Computational complexity on computable metric spaces
- Effectivity in Spaces with Admissible Multirepresentations
- Equilogical spaces
- scientific article; zbMATH DE number 3147888 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Parametrised second-order complexity theory with applications to the study of interval computation
- Polynomial and abstract subrecursive classes
- Polynomial Running Times for Polynomial-Time Oracle Machines
- Relative computability and uniform continuity of relations
- Theory of representations
- Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
Cited in
(3)
This page was built for publication: Quantitative coding and complexity theory of compact metric spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106606)