Complexity Theory of (Functions on) Compact Metric Spaces
From MaRDI portal
Publication:4635948
DOI10.1145/2933575.2935311zbMath1401.03086OpenAlexW2531200539MaRDI QIDQ4635948
Florian Steinberg, Martin Ziegler, Akitoshi Kawamura
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
Analysis of algorithms and problem complexity (68Q25) Computation over the reals, computable analysis (03D78)
Related Items (5)
Exact real computation of solution operators for linear analytic systems of partial differential equations ⋮ Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations ⋮ Polynomial Running Times for Polynomial-Time Oracle Machines ⋮ Quantitative coding and complexity theory of compact metric spaces ⋮ Bit-complexity of solving systems of linear evolutionary partial differential equations
This page was built for publication: Complexity Theory of (Functions on) Compact Metric Spaces
