Pages that link to "Item:Q3698169"
From MaRDI portal
The following pages link to On the cost of approximating all roots of a complex polynomial (Q3698169):
Displaying 13 items.
- On the complexity of computing the logarithm and square root functions on a complex domain (Q870336) (← links)
- 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)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
- On the complexity of a PL homotopy algorithm for zeros of polynomials (Q1314945) (← links)
- Specified precision polynomial root isolation is in NC (Q1329153) (← links)
- Complexity Analysis of Root Clustering for a Complex Polynomial (Q2985810) (← links)
- (Q3345695) (← links)
- On the efficiency of algorithms of analysis (Q3721699) (← links)
- The Complexity of Approximating the Matching Polynomial in the Complex Plane (Q5065635) (← links)
- On the geometry of Graeffe iteration (Q5949383) (← links)
