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 6 items.
- 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)
- Smale 17th Problem: Advances and Open Directions (Q3380357) (← links)
- Functional norms, condition numbers and numerical algorithms in algebraic geometry (Q5056386) (← links)
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems (Q5220197) (← links)
- Rigid continuation paths II. structured polynomial systems (Q6103341) (← links)
