Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems (Q5220197): Difference between revisions

@@ Property / describes a project that uses @@
+alphaCertified
@@ Property / describes a project that uses: alphaCertified / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Bertini
@@ Property / describes a project that uses: Bertini / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2982575816
@@ Property / OpenAlex ID: W2982575816 / rank @@
+Normal rank
@@ Property / cites work @@
+Condition length and complexity for the solution of polynomial systems
+Normal rank
@@ Property / cites work @@
+A stable, polynomial-time algorithm for the eigenpair problem
+Normal rank
@@ Property / cites work @@
+Q2872959
@@ Property / cites work: Q2872959 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of partial derivatives
@@ Property / cites work: The complexity of partial derivatives / rank @@
+Normal rank
@@ Property / cites work @@
+A continuation method to solve polynomial systems and its complexity
+Normal rank
@@ Property / cites work @@
+On Smale's 17th problem: a probabilistic positive solution
+Normal rank
@@ Property / cites work @@
+Efficient polynomial system-solving by numerical methods
+Normal rank
@@ Property / cites work @@
+Smale’s 17th problem: Average polynomial time to compute affine and projective solutions
+Normal rank
@@ Property / cites work @@
+Fast linear homotopy to find approximate zeros of polynomial systems
+Normal rank
@@ Property / cites work @@
+Complexity of Bezout's theorem. VII: Distance estimates in the condition metric
+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 @@
+The Condition Number of Join Decompositions
@@ Property / cites work: The Condition Number of Join Decompositions / rank @@
+Normal rank
@@ Property / cites work @@
+Fast computation of zeros of polynomial systems with bounded degree under finite-precision
+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 @@
+Adaptive step-size selection for homotopy methods to solve polynomial equations
+Normal rank
@@ Property / cites work @@
+Fixed points, zeros and Newton's method
@@ Property / cites work: Fixed points, zeros and Newton's method / rank @@
+Normal rank
@@ Property / cites work @@
+The Probability That a Numerical Analysis Problem is Difficult
+Normal rank
@@ Property / cites work @@
+Curvature Measures
@@ Property / cites work: Curvature Measures / rank @@
+Normal rank
@@ Property / cites work @@
+Q4248250
@@ Property / cites work: Q4248250 / rank @@
+Normal rank
@@ Property / cites work @@
+Certified predictor-corrector tracking for Newton homotopies
+Normal rank
@@ Property / cites work @@
+Algorithm 921
@@ Property / cites work: Algorithm 921 / rank @@
+Normal rank
@@ Property / cites work @@
+Most Tensor Problems Are NP-Hard
@@ Property / cites work: Most Tensor Problems Are NP-Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Unitary Triangularization of a Nonsymmetric Matrix
+Normal rank
@@ Property / cites work @@
+The kinematic formula in Riemannian homogeneous spaces
+Normal rank
@@ Property / cites work @@
+A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time
+Normal rank
@@ Property / cites work @@
+On generalized Newton algorithms: Quadratic convergence, path-following and error analysis
+Normal rank
@@ Property / cites work @@
+Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric
+Normal rank
@@ Property / cites work @@
+On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
+Normal rank
@@ Property / cites work @@
+On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials
+Normal rank
@@ Property / cites work @@
+On the distance to the zero set of a homogeneous polynomial
+Normal rank
@@ Property / cites work @@
+Q4279734
@@ Property / cites work: Q4279734 / 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. III: Condition number and packing
+Normal rank
@@ Property / cites work @@
+Complexity of Bezout's theorem. V: Polynomial time
+Normal rank
@@ Property / cites work @@
+Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
+Normal rank
@@ Property / cites work @@
+On the efficiency of algorithms of analysis
@@ Property / cites work: On the efficiency of algorithms of analysis / rank @@
+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