Small Complexity Classes for Computable Analysis
From MaRDI portal
Publication:2922629
DOI10.1007/978-3-662-44465-8_37zbMath1427.68097OpenAlexW2207885555MaRDI QIDQ2922629
Hiroyuki Ota, Akitoshi Kawamura
Publication date: 14 October 2014
Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44465-8_37
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computation over the reals, computable analysis (03D78)
Related Items (5)
Towards Computational Complexity Theory on Advanced Function Spaces in Analysis ⋮ Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations ⋮ Type-two polynomial-time and restricted lookahead ⋮ Parametrised second-order complexity theory with applications to the study of interval computation ⋮ Polynomial Running Times for Polynomial-Time Oracle Machines
This page was built for publication: Small Complexity Classes for Computable Analysis
