Small complexity classes for computable analysis

DOI10.1007/978-3-662-44465-8_37MaRDI QIDQ2922629zbMATH OpenOpenAlexFDO

Authors Akitoshi Kawamura, Hiroyuki Ota

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

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited in

(9)

• Parametrised second-order complexity theory with applications to the study of interval computation
• Second-order linear-time computability with applications to computable analysis
• Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
• Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
• On the Computational Complexity of Small Descriptions
• Polynomial Running Times for Polynomial-Time Oracle Machines
• On the complexity of small description and related topics
• Quantitative coding and complexity theory of \textit{continuous} data. I: Motivation, definition, consequences
• Small PCPs with low query complexity

This page was built for publication: Small complexity classes for computable analysis

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