Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH
From MaRDI portal
Publication:4916232
DOI10.1016/S1571-0661(03)00005-7zbMath1261.68058WikidataQ57733251 ScholiaQ57733251MaRDI QIDQ4916232
Paulin Jacobé de Naurois, Jean-Yves Marion, Felipe Cucker, Olivier Bournez
Publication date: 19 April 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s1571-0661(03)00005-7
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
68Q19: Descriptive complexity and finite models
03D78: Computation over the reals, computable analysis
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new recursion-theoretic characterization of the polytime functions
- Metafinite model theory
- The expressive power of higher-order types or, life without CONS
- Accessible telephone directories
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines