A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time (Q1683739): Difference between revisions

@@ Property / DOI @@
-.1007/s10208-016-9319-7
@@ Property / DOI: 10.1007/s10208-016-9319-7 / rank @@
-Normal rank
@@ Property / arXiv ID @@
+.05485
@@ Property / arXiv ID: 1507.05485 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric
+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 IV: Probability of Success; Extensions
+Normal rank
@@ Property / cites work @@
+Q4720691
@@ Property / cites work: Q4720691 / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical problems for the next century
@@ Property / cites work: Mathematical problems for the next century / 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 @@
+Fast linear homotopy to find approximate zeros of polynomial systems
+Normal rank
@@ Property / cites work @@
+On a problem posed by Steve Smale
@@ Property / cites work: On a problem posed by Steve Smale / rank @@
+Normal rank
@@ Property / cites work @@
+Condition
@@ Property / cites work: Condition / rank @@
+Normal rank
@@ Property / cites work @@
+Smale’s 17th problem: Average polynomial time to compute affine and projective solutions
+Normal rank
@@ Property / cites work @@
+Smoothed analysis of algorithms
@@ Property / cites work: Smoothed analysis of algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fast computation of zeros of polynomial systems with bounded degree under finite-precision
+Normal rank
@@ Property / cites work @@
+COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
@@ Property / cites work: COMPLEXITY AND REAL COMPUTATION: A MANIFESTO / rank @@
+Normal rank
@@ Property / cites work @@
+Q4279734
@@ Property / cites work: Q4279734 / rank @@
+Normal rank
@@ Property / cites work @@
+A method for generating uniformly distributed points on \(N\)-dimensional spheres
+Normal rank
@@ Property / cites work @@
+A stable, polynomial-time algorithm for the eigenpair problem
+Normal rank
@@ Property / cites work @@
+A randomized homotopy for the Hermitian eigenpair problem
+Normal rank
@@ Property / cites work @@
+The complexity of partial derivatives
@@ Property / cites work: The complexity of partial derivatives / rank @@
+Normal rank
@@ Property / cites work @@
+Condition length and complexity for the solution of polynomial systems
+Normal rank
@@ Property / cites work @@
+A continuation method to solve polynomial systems and its complexity
+Normal rank
@@ Property / DOI @@
+.1007/S10208-016-9319-7
@@ Property / DOI: 10.1007/S10208-016-9319-7 / rank @@
+Normal rank