Computational complexity on computable metric spaces
From MaRDI portal
Recommendations
- Bounded time computation on metric spaces and Banach spaces
- Complexity theory of (functions on) compact metric spaces
- Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval
- scientific article; zbMATH DE number 1222103
- Computability on computable metric spaces
Cited in
(33)- Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval
- Oracle and interactive computations, post-Turing thesis and man-machine interactions
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- Complexity theory for spaces of integrable functions
- The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
- Admissibly Represented Spaces and Qcb-Spaces
- Complexity of operators on compact sets
- Complexity theory of (functions on) compact metric spaces
- Relative computability and uniform continuity of relations
- Type 2 computational complexity of functions on Cantor's space
- A polynomial time computable metric between points sets
- Exact real computation of solution operators for linear analytic systems of partial differential equations
- Borel Complexity of Topological Operations on Computable Metric Spaces
- Bounded time computation on metric spaces and Banach spaces
- Weihrauch degrees, omniscience principles and weak computability
- Quantitative coding and complexity theory of compact metric spaces
- Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
- Closed choice and a uniform low basis theorem
- Analytical properties of resource-bounded real functionals
- Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision
- Semantics, specification logic, and Hoare logic of exact real computation
- scientific article; zbMATH DE number 17703 (Why is no real title available?)
- On the topological aspects of the theory of represented spaces
- On computable compact operators on Banach spaces
- On the Complexity of Metric Dimension
- On the complexity of the theory of a computably presented metric structure
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
- Computational complexity of classical solutions of partial differential equations
- Probabilistic computability and choice
- Computability of the metric projection onto finite-dimensional linear subspaces
- COMPUTABLY COMPACT METRIC SPACES
- Bit-complexity of solving systems of linear evolutionary partial differential equations
- Computability of finite-dimensional linear subspaces and best approximation
This page was built for publication: Computational complexity on computable metric spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4798201)