Complexity of Bezout's theorem. V: Polynomial time (Q1338222): Difference between revisions

@@ 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 @@
+Separation of complexity classes in Koiran's weak model
+Normal rank
@@ Property / cites work @@
+Q3994358
@@ Property / cites work: Q3994358 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4279722
@@ Property / cites work: Q4279722 / rank @@
+Normal rank
@@ Property / cites work @@
+<i>Computational Complexity</i>: On the Geometry of Polynomials and a Theory of Cost: II
+Normal rank
@@ Property / cites work @@
+Complexity of Bezout's Theorem I: Geometric Aspects
+Normal rank
@@ Property / cites work @@
+Q3135179
@@ Property / cites work: Q3135179 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Bezout's theorem. III: Condition number and packing
+Normal rank
@@ Property / cites work @@
+Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
+Normal rank
@@ Property / cites work @@
+The fundamental theorem of algebra and complexity theory
+Normal rank
@@ Property / cites work @@
+Q3816922
@@ Property / cites work: Q3816922 / rank @@
+Normal rank
@@ Property / cites work @@
+Some Remarks on the Foundations of Numerical Analysis
+Normal rank
@@ Property / cites work @@
+The kinematic formula in Riemannian homogeneous spaces
+Normal rank
@@ Property / cites work @@
+Q4110292
@@ Property / cites work: Q4110292 / rank @@
+Normal rank