Complexity theory for operators in analysis
From MaRDI portal
Publication:2947565
DOI10.1145/2189778.2189780zbMATH Open1322.68083arXiv1305.0453OpenAlexW2570115677MaRDI QIDQ2947565FDOQ2947565
Authors: Akitoshi Kawamura, Stephen Cook 
Publication date: 24 September 2015
Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)
Abstract: We propose an extension of the framework for discussing the computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represented only through approximation. The key idea is to use (a certain class of) string functions as names representing these objects. These are more expressive than infinite sequences, which served as names in prior work that formulated complexity in more restricted settings. An advantage of using string functions is that we can define their "size" in the way inspired by higher-type complexity theory. This enables us to talk about computation on string functions whose time or space is bounded polynomially in the input size, giving rise to more general analogues of the classes P, NP, and PSPACE. We also define NP- and PSPACE-completeness under suitable many-one reductions. Because our framework separates machine computation and semantics, it can be applied to problems on sets of interest in analysis once we specify a suitable representation (encoding). As prototype applications, we consider the complexity of functions (operators) on real numbers, real sets, and real functions. For example, the task of numerical algorithms for solving a certain class of differential equations is naturally viewed as an operator taking real functions to real functions. As there was no complexity theory for operators, previous results only stated how complex the solution can be. We now reformulate them and show that the operator itself is polynomial-space complete.
Full work available at URL: https://arxiv.org/abs/1305.0453
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computation over the reals, computable analysis (03D78) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited In (33)
- Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving
- Computational complexity theory for advanced function spaces in analysis
- Semantics, specification logic, and Hoare logic of exact real computation
- Complexity of operators on compact sets
- Parametrised second-order complexity theory with applications to the study of interval computation
- Computable analysis and notions of continuity in \textsc{Coq}
- Title not available (Why is that?)
- Analytical properties of resource-bounded real functionals
- Title not available (Why is that?)
- Representations and evaluation strategies for feasibly approximable functions
- On the computational complexity of the Dirichlet problem for Poisson's equation
- Average-case polynomial-time computability of Hamiltonian dynamics
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
- Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
- Bit-complexity of solving systems of linear evolutionary partial differential equations
- The ksmt calculus is a \(\delta \)-complete decision procedure for non-linear constraints
- Polynomial Running Times for Polynomial-Time Oracle Machines
- Many-one reductions and the category of multivalued functions
- Complete and tractable machine-independent characterizations of second-order polytime
- On the complexity of robust eventual inequality testing for C-finite functions
- Complexity theory for operators in analysis
- Computable Measure Theory and Algorithmic Randomness
- On basic feasible functionals and the interpretation method
- Computability of Differential Equations
- Operational complexity and pumping lemmas
- Quantitative continuity and Computable Analysis in Coq
- The complexity of some ordinal determined classes of operators
- Algorithms and Computation
- Title not available (Why is that?)
- Parametrized uniform complexity of computation in geometry and numerics
- On the query complexity of real functionals
- Quantitative coding and complexity theory of compact metric spaces
- Polynomial time over the reals with parsimony
This page was built for publication: Complexity theory for operators in analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947565)
