A note on non-complete problems in $NP_\mathbb{R}$ (Q1977151): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1006/jcom.1999.0537
+Normal rank
@@ Property / OpenAlex ID @@
+W2044150078
@@ Property / OpenAlex ID: W2044150078 / rank @@
+Normal rank
@@ Property / cites work @@
+Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
+Normal rank
@@ Property / cites work @@
+Q4717931
@@ Property / cites work: Q4717931 / rank @@
+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 @@
+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 @@
+Two \(P\)-complete problems in the theory of the reals
+Normal rank
@@ Property / cites work @@
+Q4717945
@@ Property / cites work: Q4717945 / rank @@
+Normal rank
@@ Property / cites work @@
+Accessible telephone directories
@@ Property / cites work: Accessible telephone directories / 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
@@ Property / cites work @@
+Q4841154
@@ Property / cites work: Q4841154 / rank @@
+Normal rank
@@ Property / cites work @@
+A uniform approach to obtain diagonal sets in complexity classes
+Normal rank

A note on non-complete problems in \(NP_\mathbb{R}\) (Q1977151): Difference between revisions

Latest revision as of 15:59, 29 May 2024

Statements

Sitelinks

Mathematics(1 entry)