Pages that link to "Item:Q3698168"
From MaRDI portal
The following pages link to On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials (Q3698168):
Displaying 4 items.
- Optimal solution of nonlinear equations (Q1086985) (← links)
- Rudiments of an average case complexity theory for piecewise-linear path following algorithms (Q1111475) (← links)
- Some computational methods for systems of nonlinear equations and systems of polynomial equations (Q1201902) (← links)
- On the efficiency of algorithms of analysis (Q3721699) (← links)
