Complexity theory of (functions on) compact metric spaces

DOI10.1145/2933575.2935311zbMATH Open1401.03086OpenAlexW2531200539MaRDI QIDQ4635948FDOQ4635948

Authors Akitoshi Kawamura, Florian Steinberg, Martin Ziegler 

Publication date 23 April 2018

Published in Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2933575.2935311

zbMATH Keywords

metric entropybit complexityrecursive analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computation over the reals, computable analysis (03D78)

Recommendations

• Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval
• Bounded time computation on metric spaces and Banach spaces
• Computational complexity on computable metric spaces
• Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
• Type 2 computational complexity of functions on Cantor's space

Cited in

(18)

• Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval
• THE A-COMPLEXITY OF A SPACE
• scientific article; zbMATH DE number 769607 (Why is no real title available?)
• Type 2 computational complexity of functions on Cantor's space
• 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
• Encoding of data sets and algorithms
• Quantitative coding and complexity theory of compact metric spaces
• Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
• Polynomial Running Times for Polynomial-Time Oracle Machines
• Semantics, specification logic, and Hoare logic of exact real computation
• Computational complexity on computable metric spaces
• 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
• Amorphic complexity can take any nonnegative value in general metric spaces
• Bit-complexity of solving systems of linear evolutionary partial differential equations
• Complexity of finite sequences of zeros and ones and geometry of finite spaces of functions

This page was built for publication: Complexity theory of (functions on) compact metric spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635948)