Pages that link to "Item:Q3330394"
From MaRDI portal
The following pages link to On the cost of computing roots of polynomials (Q3330394):
Displaying 16 items.
- Finding cactus roots in polynomial time (Q726100) (← links)
- Optimal solution of nonlinear equations (Q1086985) (← links)
- On the worst-case arithmetic complexity of approximating zeros of polynomials (Q1101184) (← 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)
- Horner versus Holdred: An episode in the history of root computation (Q1283015) (← links)
- On the complexity of a PL homotopy algorithm for zeros of polynomials (Q1314945) (← links)
- Fine costs for Euclid's algorithm on polynomials and Farey maps (Q2439896) (← links)
- Relative performance evaluation for dynamic contracts in a large competitive market (Q2672102) (← links)
- Computers and the Multiplicity of Polynomial Roots (Q3327625) (← links)
- (Q3345695) (← links)
- On the cost of approximating all roots of a complex polynomial (Q3698169) (← links)
- On the efficiency of algorithms of analysis (Q3721699) (← links)
- Computational complexity. On the geometry of polynomials and a theory of cost. I (Q3740132) (← links)
- How to be sure of finding a root of a complex polynomial using Newton's method (Q5285715) (← links)
