Counting connected components of a semialgebraic set in subexponential time (Q1207337): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of elementary algebra and geometry
@@ Property / cites work: The complexity of elementary algebra and geometry / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing roadmaps of semi-algebraic sets. I: Completeness
+Normal rank
@@ Property / cites work @@
+Q4079605
@@ Property / cites work: Q4079605 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5643279
@@ Property / cites work: Q5643279 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of deciding Tarski algebra
@@ Property / cites work: Complexity of deciding Tarski algebra / rank @@
+Normal rank
@@ Property / cites work @@
+Solving systems of polynomial inequalities in subexponential time
+Normal rank
@@ Property / cites work @@
+Definability and fast quantifier elimination in algebraically closed fields
+Normal rank
@@ Property / cites work @@
+On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials
+Normal rank
@@ Property / cites work @@
+Q4771357
@@ Property / cites work: Q4771357 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5807665
@@ Property / cites work: Q5807665 / rank @@
+Normal rank