On Smale's 17th problem: a probabilistic positive solution
From MaRDI portal
Computational complexityApproximate zero theoryProbabilistic polynomial timeProjective algebraic varietySystem of equations
Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Numerical computation of solutions to systems of equations (65H10) Integration on manifolds; measures on manifolds (58C35) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)
Recommendations
- A faster solution to Smale's 17th problem. I: Real binomial systems
- Smale's 17th problem: average polynomial time to compute affine and projective solutions
- Numerically determining solutions of systems of polynomial equations
- On a problem posed by Steve Smale
- Rigid continuation paths II. structured polynomial systems
- Solving polynomial equations in smoothed polynomial time and a near solution to Smale's 17th problem
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
- Condition length and complexity for the solution of polynomial systems
- Fast computation of zeros of polynomial systems with bounded degree under finite-precision
- scientific article; zbMATH DE number 5124810
Cited in
(30)- On a problem posed by Steve Smale
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
- On the geometry and topology of the solution variety for polynomial system solving
- Smale's 17th problem: average polynomial time to compute affine and projective solutions
- Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric
- Random sampling in computational algebra: Helly numbers and violator spaces
- Learning a performance metric of Buchberger's algorithm
- A faster solution to Smale's 17th problem. I: Real binomial systems
- A note on the finite variance of the averaging function for polynomial system solving
- Smale's fundamental theorem of algebra reconsidered
- Certified numerical homotopy tracking
- Functional norms, condition numbers and numerical algorithms in algebraic geometry
- Smale 17th Problem: Advances and Open Directions
- Certified predictor-corrector tracking for Newton homotopies
- Fast computation of zeros of polynomial systems with bounded degree under finite-precision
- Robust certified numerical homotopy tracking
- Complexity of Bezout's theorem. V: Polynomial time
- scientific article; zbMATH DE number 1859208 (Why is no real title available?)
- On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant
- Rigid continuation paths II. structured polynomial systems
- An arithmetic Poisson formula for the multi-variate resultant
- Nonlinear equations. Paper from the 28th Brazilian mathematics colloquium -- 28\(^{\text o}\) Colóquio Brasileiro de Matemática, Rio de Janeiro, Brazil, July 2011
- Condition numbers for the cube. I: Univariate polynomials and hypersurfaces
- Foreword. What is numerical algebraic geometry?
- A numerical algorithm for zero counting. III: Randomization and condition
- Globally convergent, iterative path-following for algebraic equations
- A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density
- On the probability distribution of data at points in real complete intersection varieties
- A continuation method to solve polynomial systems and its complexity
- Fast linear homotopy to find approximate zeros of polynomial systems
This page was built for publication: On Smale's 17th problem: a probabilistic positive solution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q937276)
