SOME INITIAL THOUGHTS ON BOUNDED QUERY COMPUTATIONS OVER THE REALS (Q4923293): Difference between revisions

@@ Property / cites work @@
+A note on non-complete problems in \(NP_\mathbb{R}\)
+Normal rank
@@ Property / cites work @@
+On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
+Normal rank
@@ Property / cites work @@
+\(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\)
@@ Property / cites work: \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\) / rank @@
+Normal rank
@@ Property / cites work @@
+On the Structure of $\cal NP_\Bbb C$
@@ Property / cites work: On the Structure of $\cal NP_\Bbb C$ / rank @@
+Normal rank
@@ Property / cites work @@
+An explicit solution to Post's problem over the reals
+Normal rank
@@ Property / cites work @@
+P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
+Normal rank