Computational complexity on computable metric spaces
DOI10.1002/MALQ.200310001zbMATH Open1018.03049OpenAlexW2117033549MaRDI QIDQ4798201FDOQ4798201
Authors: Klaus Weihrauch 
Publication date: 19 March 2003
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.200310001
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
Metric spaces, metrizability (54E35) Theory of numerations, effectively presented structures (03D45) Complexity of computation (including implicit computational complexity) (03D15) Applications of computability and recursion theory (03D80) Constructive and recursive analysis (03F60)
Cited In (33)
- A polynomial time computable metric between points sets
- Title not available (Why is that?)
- Computational complexity of classical solutions of partial differential equations
- Exact real computation of solution operators for linear analytic systems of partial differential equations
- Semantics, specification logic, and Hoare logic of exact real computation
- Complexity of operators on compact sets
- Closed choice and a uniform low basis theorem
- On the topological aspects of the theory of represented spaces
- Admissibly Represented Spaces and Qcb-Spaces
- Complexity theory for spaces of integrable functions
- Bounded time computation on metric spaces and Banach spaces
- Analytical properties of resource-bounded real functionals
- Complexity theory of (functions on) compact metric spaces
- Relative computability and uniform continuity of relations
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
- COMPUTABLY COMPACT METRIC SPACES
- The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
- Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
- Computability of the metric projection onto finite-dimensional linear subspaces
- Bit-complexity of solving systems of linear evolutionary partial differential equations
- On the complexity of the theory of a computably presented metric structure
- On computable compact operators on Banach spaces
- Probabilistic computability and choice
- Weihrauch degrees, omniscience principles and weak computability
- Computability of finite-dimensional linear subspaces and best approximation
- 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
- On the Complexity of Metric Dimension
- Borel Complexity of Topological Operations on Computable Metric Spaces
- Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision
- Type 2 computational complexity of functions on Cantor's space
- Quantitative coding and complexity theory of compact metric spaces
- Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval
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)
