On Ladner’s Result for a Class of Real Machines with Restricted Use of Constants (Q3576067): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-03073-4_36
+Normal rank
@@ Property / OpenAlex ID @@
+W2133621875
@@ Property / OpenAlex ID: W2133621875 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on non-complete problems in \(NP_\mathbb{R}\)
+Normal rank
@@ Property / cites work @@
+COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
@@ Property / cites work: COMPLEXITY AND REAL COMPUTATION: A MANIFESTO / rank @@
+Normal rank
@@ Property / cites work @@
+Q4381389
@@ Property / cites work: Q4381389 / rank @@
+Normal rank
@@ Property / cites work @@
+Saturation and stability in the theory of computation over the reals
+Normal rank
@@ Property / cites work @@
+Separation of complexity classes in Koiran's weak model
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Structure of Polynomial Time Reducibility
@@ Property / cites work: On the Structure of Polynomial Time Reducibility / 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 @@
+P\(\neq\)NP over the nonstandard reals implies P\(\neq\)NP over \(\mathbb{R}\)
+Normal rank