Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
From MaRDI portal
Publication:3188250
DOI10.1007/978-3-319-40189-8_15zbMath1476.03066OpenAlexW2476980550MaRDI QIDQ3188250
Akitoshi Kawamura, Florian Steinberg, Martin Ziegler
Publication date: 17 August 2016
Published in: Pursuit of the Universal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-40189-8_15
Complexity of computation (including implicit computational complexity) (03D15) Computation over the reals, computable analysis (03D78)
Related Items (3)
Parametrised second-order complexity theory with applications to the study of interval computation ⋮ Polynomial Running Times for Polynomial-Time Oracle Machines ⋮ Quantitative coding and complexity theory of compact metric spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relativizing small complexity classes and their theories
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- Topological properties of concept spaces (full version)
- Relativized alternation and space-bounded computation
- A measure of relativized space which is faithful with respect to depth
- A Banach-Mazur computable but not Markov computable function on the computable real numbers
- Characterizing polynomial time complexity of stream programs using interpretations
- Real hypercomputation and continuity
- On the Computational Complexity of Positive Linear Functionals on $$\mathcal{C}[0;1$$]
- Computational Complexity of Smooth Differential Equations
- Small Complexity Classes for Computable Analysis
- Relative computability and uniform continuity of relations
- Complexity Theory for Operators in Analysis
- IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
- Spaces allowing Type‐2 Complexity Theory revisited
- On Computability of Navier-Stokes’ Equation
- Computational complexity on computable metric spaces
- A new Characterization of Type-2 Feasibility
- Function Spaces for Second-Order Polynomial Time
- Regular Real Analysis
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- Logical Approaches to Computational Barriers
This page was built for publication: Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
