On Ladner’s Result for a Class of Real Machines with Restricted Use of Constants
From MaRDI portal
Publication:3576067
DOI10.1007/978-3-642-03073-4_36zbMath1268.03063MaRDI QIDQ3576067
Publication date: 28 July 2010
Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03073-4_36
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
03D78: Computation over the reals, computable analysis
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Saturation and stability in the theory of computation over the reals
- Separation of complexity classes in Koiran's weak model
- P\(\neq\)NP over the nonstandard reals implies P\(\neq\)NP over \(\mathbb{R}\)
- A note on non-complete problems in \(NP_\mathbb{R}\)
- On the Structure of Polynomial Time Reducibility
- On the Structure of $\cal NP_\Bbb C$
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO