Pages that link to "Item:Q3079201"
From MaRDI portal
The following pages link to Smale’s 17th problem: Average polynomial time to compute affine and projective solutions (Q3079201):
Displaying 38 items.
- Random sampling in computational algebra: Helly numbers and violator spaces (Q277210) (← links)
- On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant (Q315740) (← links)
- Smale's fundamental theorem of algebra reconsidered (Q404254) (← links)
- Complexity of path-following methods for the eigenvalue problem (Q404275) (← links)
- Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian (Q423886) (← links)
- A complex analogue of Toda's theorem (Q454132) (← links)
- Condition length and complexity for the solution of polynomial systems (Q506608) (← links)
- Numerical computation of the genus of an irreducible curve within an algebraic set (Q534004) (← links)
- A continuation method to solve polynomial systems and its complexity (Q621308) (← links)
- Fast linear homotopy to find approximate zeros of polynomial systems (Q626447) (← links)
- On a problem posed by Steve Smale (Q661924) (← links)
- On Smale's 17th problem: a probabilistic positive solution (Q937276) (← links)
- Complexity of Bezout's theorem. VII: Distance estimates in the condition metric (Q1022431) (← links)
- Random monomial ideals (Q1628515) (← links)
- A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time (Q1683739) (← links)
- Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric (Q1727976) (← links)
- Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions (Q1727980) (← links)
- Systems of rational polynomial equations have polynomial size approximate zeros on the average (Q1869964) (← links)
- On the geometry and topology of the solution variety for polynomial system solving (Q1928275) (← links)
- Robust certified numerical homotopy tracking (Q1955526) (← links)
- A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density (Q2052162) (← links)
- Mixed precision path tracking for polynomial homotopy continuation (Q2240693) (← links)
- A note on the finite variance of the averaging function for polynomial system solving (Q2269908) (← links)
- Computing the homology of semialgebraic sets. I: Lax formulas (Q2291730) (← links)
- A randomized homotopy for the Hermitian eigenpair problem (Q2340509) (← links)
- An arithmetic Poisson formula for the multi-variate resultant (Q2441516) (← links)
- Complexity of an Homotopy Method at the Neighbourhood of a Zero (Q2832953) (← links)
- The Legacy of Turing in Numerical Analysis (Q2891357) (← links)
- Minimizing the discrete logarithmic energy on the sphere: The role of random polynomials (Q3004359) (← links)
- Smoothed analysis for the condition number of structured real polynomial systems (Q4999472) (← links)
- Functional norms, condition numbers and numerical algorithms in algebraic geometry (Q5056386) (← links)
- A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF (Q5177339) (← links)
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems (Q5220197) (← links)
- Fast computation of zeros of polynomial systems with bounded degree under finite-precision (Q5401702) (← links)
- Probabilistic analyses of condition numbers (Q5740078) (← links)
- Rigid continuation paths II. structured polynomial systems (Q6103341) (← links)
- Learning a performance metric of Buchberger's algorithm (Q6117059) (← links)
- Asymptotic degree of random monomial ideals (Q6170625) (← links)
