SOME INITIAL THOUGHTS ON BOUNDED QUERY COMPUTATIONS OVER THE REALS
From MaRDI portal
Publication:4923293
DOI10.1142/S0129054112400618zbMath1297.03028OpenAlexW2064335432MaRDI QIDQ4923293
Publication date: 6 June 2013
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054112400618
Cites Work
- \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\)
- A note on non-complete problems in \(NP_\mathbb{R}\)
- An explicit solution to Post's problem over the reals
- P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
- On the Structure of $\cal NP_\Bbb C$
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
This page was built for publication: SOME INITIAL THOUGHTS ON BOUNDED QUERY COMPUTATIONS OVER THE REALS