Pages that link to "Item:Q1022431"
From MaRDI portal
The following pages link to Complexity of Bezout's theorem. VII: Distance estimates in the condition metric (Q1022431):
Displaying 14 items.
- Self-convexity and curvature (Q290787) (← 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)
- The unavoidable condition\dots A report on the book. Book review of: P. Bürgisser and F. Cucker, Condition. The geometry of numerical algorithms (Q494615) (← 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)
- A numerical algorithm for zero counting. III: Randomization and condition (Q651058) (← links)
- On a problem posed by Steve Smale (Q661924) (← links)
- Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric (Q1727976) (← links)
- On the geometry and topology of the solution variety for polynomial system solving (Q1928275) (← links)
- Smale’s 17th problem: Average polynomial time to compute affine and projective solutions (Q3079201) (← links)
- Geometry of polynomials and root-finding via path-lifting (Q4606640) (← links)
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems (Q5220197) (← links)
- Rigid continuation paths II. structured polynomial systems (Q6103341) (← links)
