Complexity Theory for Operators in Analysis
From MaRDI portal
Publication:2947565
DOI10.1145/2189778.2189780zbMath1322.68083arXiv1305.0453OpenAlexW2570115677MaRDI QIDQ2947565
Akitoshi Kawamura, Stephen A. Cook
Publication date: 24 September 2015
Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.0453
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computation over the reals, computable analysis (03D78)
Related Items (20)
Towards Computational Complexity Theory on Advanced Function Spaces in Analysis ⋮ Unnamed Item ⋮ The ksmt calculus is a \(\delta \)-complete decision procedure for non-linear constraints ⋮ On the computational complexity of the Dirichlet Problem for Poisson's Equation ⋮ Complete and tractable machine-independent characterizations of second-order polytime ⋮ Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations ⋮ Many-one reductions and the category of multivalued functions ⋮ Quantitative continuity and Computable Analysis in Coq ⋮ Average-case polynomial-time computability of hamiltonian dynamics ⋮ Type-two polynomial-time and restricted lookahead ⋮ Analytical properties of resource-bounded real functionals ⋮ Parametrised second-order complexity theory with applications to the study of interval computation ⋮ Polynomial time over the reals with parsimony ⋮ Representations and evaluation strategies for feasibly approximable functions ⋮ Polynomial Running Times for Polynomial-Time Oracle Machines ⋮ Unnamed Item ⋮ Quantitative coding and complexity theory of compact metric spaces ⋮ Computability of Differential Equations ⋮ Computable Measure Theory and Algorithmic Randomness ⋮ Bit-complexity of solving systems of linear evolutionary partial differential equations
This page was built for publication: Complexity Theory for Operators in Analysis
