Separation of complexity classes in Koiran's weak model (Q1338212): Difference between revisions

@@ Property / cites work @@
+Q3692867
@@ Property / cites work: Q3692867 / 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 @@
+\(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 Complexity of Quantifier Elimination: the Structural Approach
+Normal rank
@@ Property / cites work @@
+On digital nondeterminism
@@ Property / cites work: On digital nondeterminism / rank @@
+Normal rank
@@ Property / cites work @@
+Real quantifier elimination is doubly exponential
@@ Property / cites work: Real quantifier elimination is doubly exponential / rank @@
+Normal rank
@@ Property / cites work @@
+Nonuniform proof systems: A new framework to describe nonuniform and probabilistic complexity classes
+Normal rank
@@ Property / cites work @@
+Turing machines that take advice
@@ Property / cites work: Turing machines that take advice / rank @@
+Normal rank
@@ Property / cites work @@
+Computing over the reals with addition and order
@@ Property / cites work: Computing over the reals with addition and order / rank @@
+Normal rank
@@ Property / cites work @@
+A note on a \(P \neq NP\) result for a restricted class of real machines
+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 @@
+Complexity of Presburger arithmetic with fixed quantifier dimension
+Normal rank
@@ Property / cites work @@
+Q4131648
@@ Property / cites work: Q4131648 / rank @@
+Normal rank