Pages that link to "Item:Q506608"
From MaRDI portal
The following pages link to Condition length and complexity for the solution of polynomial systems (Q506608):
Displaying 19 items.
- Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian (Q423886) (← links)
- Fast linear homotopy to find approximate zeros of polynomial systems (Q626447) (← links)
- Condition number based complexity estimate for solving polynomial systems (Q629539) (← links)
- On a problem posed by Steve Smale (Q661924) (← links)
- On Smale's 17th problem: a probabilistic positive solution (Q937276) (← links)
- Message length effects for solving polynomial systems on a hypercube (Q1121641) (← links)
- Complexity of Bezout's theorem. V: Polynomial time (Q1338222) (← 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)
- Systems of rational polynomial equations have polynomial size approximate zeros on the average (Q1869964) (← links)
- Approximate zeros and condition numbers (Q1974565) (← links)
- A note on the finite variance of the averaging function for polynomial system solving (Q2269908) (← links)
- On a condition number of general random polynomial systems (Q2792338) (← links)
- Smale 17th Problem: Advances and Open Directions (Q3380357) (← links)
- A condition number theorem for underdetermined polynomial systems (Q4517526) (← links)
- Functional norms, condition numbers and numerical algorithms in algebraic geometry (Q5056386) (← links)
- Condition numbers for the cube. I: Univariate polynomials and hypersurfaces (Q5146006) (← links)
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems (Q5220197) (← links)
- Rigid continuation paths II. structured polynomial systems (Q6103341) (← links)
