Pages that link to "Item:Q3330394"
From MaRDI portal
The following pages link to On the cost of computing roots of polynomials (Q3330394):
Displaying 6 items.
- Optimal solution of nonlinear equations (Q1086985) (← links)
- Rudiments of an average case complexity theory for piecewise-linear path following algorithms (Q1111475) (← links)
- Study of linear information for classes of polynomial equations (Q1123546) (← links)
- Some computational methods for systems of nonlinear equations and systems of polynomial equations (Q1201902) (← links)
- On the complexity of a PL homotopy algorithm for zeros of polynomials (Q1314945) (← links)
- Relative performance evaluation for dynamic contracts in a large competitive market (Q2672102) (← links)
