Complexity theory for operators in analysis

DOI10.1145/1806689.1806758zbMath1293.68134OpenAlexW2063926602MaRDI QIDQ2875177

Akitoshi Kawamura, Stephen A. Cook

Publication date: 13 August 2014

Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1806689.1806758

zbMATH Keywords

computational complexitycomputable analysishigher-type complexitysecond-order polynomials

Mathematics Subject Classification ID

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 (8)

Exact real computation of solution operators for linear analytic systems of partial differential equations ⋮ Game semantics approach to higher-order complexity ⋮ Computability on measurable functions ⋮ Analytical properties of resource-bounded real functionals ⋮ Unnamed Item ⋮ Representations and evaluation strategies for feasibly approximable functions ⋮ Computational complexity of classical solutions of partial differential equations ⋮ Weihrauch Complexity in Computable Analysis

This page was built for publication: Complexity theory for operators in analysis