Towards Computational Complexity Theory on Advanced Function Spaces in Analysis

DOI10.1007/978-3-319-40189-8_15MaRDI QIDQ3188250zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Computation over the reals, computable analysis (03D78)

Recommendations

• Computational complexity theory for advanced function spaces in analysis
• Complexity theory for spaces of integrable functions
• On Computational Constructions in Function Spaces
• Computability and complexity in analysis
• Complexity theory for operators in analysis
• Complexity theory for operators in analysis
• Complexity of functions: Some questions, conjectures, and results
• scientific article; zbMATH DE number 139637
• Complexity theory of (functions on) compact metric spaces
• On parallel complexity of analytic functions

Cites work

• A Banach-Mazur computable but not Markov computable function on the computable real numbers
• A measure of relativized space which is faithful with respect to depth
• A new Characterization of Type-2 Feasibility
• Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
• Characterizing polynomial time complexity of stream programs using interpretations
• Complexity theory for operators in analysis
• Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
• Computational complexity on computable metric spaces
• Computing over the reals: foundations for scientific computing.
• Function spaces for second-order polynomial time
• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
• Logical Approaches to Computational Barriers
• On computability of Navier-Stokes' equation
• On the Computational Complexity of Positive Linear Functionals on $$\mathcal{C}[0;1]$$
• Real hypercomputation and continuity
• Regular Real Analysis
• Relative computability and uniform continuity of relations
• Relativized alternation and space-bounded computation
• Small complexity classes for computable analysis
• Spaces allowing Type‐2 Complexity Theory revisited
• Topological properties of concept spaces (full version)

Cited in

(12)

• Quantitative coding and complexity theory of compact metric spaces
• Parametrised second-order complexity theory with applications to the study of interval computation
• On the Computational Complexity of Positive Linear Functionals on $$\mathcal{C}[0;1]$$
• A Note on the Space Complexity of Fast D-Finite Function Evaluation
• Complexity theory of (functions on) compact metric spaces
• New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces
• Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
• Polynomial Running Times for Polynomial-Time Oracle Machines
• Computational complexity theory for advanced function spaces in analysis
• Theory and Applications of Models of Computation
• On Computational Constructions in Function Spaces
• Computer Science for Continuous Data

This page was built for publication: Towards Computational Complexity Theory on Advanced Function Spaces in Analysis

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