Parametrised second-order complexity theory with applications to the study of interval computation

DOI10.1016/J.TCS.2019.05.009zbMATH Open1454.03057arXiv1711.10530OpenAlexW2771971039WikidataQ127816689 ScholiaQ127816689MaRDI QIDQ2285136FDOQ2285136

Florian Steinberg, Eike Neumann

Publication date: 16 January 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Abstract: We extend the framework for complexity of operators in analysis devised by Kawamura and Cook (2012) to allow for the treatment of a wider class of representations. The main novelty is to endow represented spaces of interest with an additional function on names, called a parameter, which measures the complexity of a given name. This parameter generalises the size function which is usually used in second-order complexity theory and therefore also central to the framework of Kawamura and Cook. The complexity of an algorithm is measured in terms of its running time as a second-order function in the parameter, as well as in terms of how much it increases the complexity of a given name, as measured by the parameters on the input and output side. As an application we develop a rigorous computational complexity theory for interval computation. In the framework of Kawamura and Cook the representation of real numbers based on nested interval enclosures does not yield a reasonable complexity theory. In our new framework this representation is polytime equivalent to the usual Cauchy representation based on dyadic rational approximation. By contrast, the representation of continuous real functions based on interval enclosures is strictly smaller in the polytime reducibility lattice than the usual representation, which encodes a modulus of continuity. Furthermore, the function space representation based on interval enclosures is optimal in the sense that it contains the minimal amount of information amongst those representations which render evaluation polytime computable.

Full work available at URL: https://arxiv.org/abs/1711.10530

zbMATH Keywords

computable analysisinterval computationsecond-order complexitytype-two complexity

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Higher-type and set recursion theory (03D65)

Cites Work

• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Computational complexity of solving polynomial differential equations over unbounded domains
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lipschitz continuous ordinary differential equations are polynomial-space complete
• Title not available (Why is that?)
• On the definitions of computable real continuous functions
• The computational complexity of maximization and integration
• Computational complexity of real functions
• Computable functionals
• Title not available (Why is that?)
• Theory of representations
• Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving
• Analytical properties of resource-bounded real functionals
• Spaces allowing Type‐2 Complexity Theory revisited
• Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
• On the computational complexity of ordinary differential equations
• Title not available (Why is that?)
• Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
• Function Spaces for Second-Order Polynomial Time
• Extended admissibility.
• Title not available (Why is that?)
• Polynomial and abstract subrecursive classes
• On characterizations of the basic feasible functionals. I
• Title not available (Why is that?)
• A new Characterization of Type-2 Feasibility
• On the definition of computable functionals
• Average-case polynomial-time computability of hamiltonian dynamics
• Computer Science Logic
• The basic feasible functionals in computable analysis
• Title not available (Why is that?)
• Polynomial Running Times for Polynomial-Time Oracle Machines
• On the Query Complexity of Real Functionals
• Small Complexity Classes for Computable Analysis
• Complexity Theory for Operators in Analysis
• On the Computational Complexity of Positive Linear Functionals on $$\mathcal{C}[0;1]$$
• Bounded time computation on metric spaces and Banach spaces

Cited In (5)

• A Shift-free Characterization of NP within Interval-valued Computing
• On the complexity of robust eventual inequality testing for C-finite functions
• Quantitative continuity and Computable Analysis in Coq
• Title not available (Why is that?)
• Quantitative coding and complexity theory of compact metric spaces

Uses Software

• Ariadne
• iRRAM

This page was built for publication: Parametrised second-order complexity theory with applications to the study of interval computation

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