The real dimension problem is \(\text{NP}_{\mathbb R}\)-complete. (Q1974570): Difference between revisions

@@ Property / cites work @@
+On the combinatorial and algebraic complexity of quantifier elimination
+Normal rank
@@ Property / cites work @@
+Q3996250
@@ Property / cites work: Q3996250 / 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 @@
+Q3770650
@@ Property / cites work: Q3770650 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3963102
@@ Property / cites work: Q3963102 / rank @@
+Normal rank
@@ Property / cites work @@
+Saturation and stability in the theory of computation over the reals
+Normal rank
@@ Property / cites work @@
+Polynomial-time computation of the dimension of algebraic varieties in zero-characteristic
+Normal rank
@@ Property / cites work @@
+Q3973337
@@ Property / cites work: Q3973337 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4850731
@@ Property / cites work: Q4850731 / rank @@
+Normal rank
@@ Property / cites work @@
+Elimination of constants from machines over algebraically closed fields
+Normal rank
@@ Property / cites work @@
+The Space Complexity of Elimination Theory: Upper Bounds
+Normal rank
@@ Property / cites work @@
+On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
+Normal rank
@@ Property / cites work @@
+Polynomials with Rational Coefficients Which are Hard to Compute
+Normal rank
@@ Property / cites work @@
+Q4542567
@@ Property / cites work: Q4542567 / rank @@
+Normal rank