Pages that link to "Item:Q3028211"
From MaRDI portal
The following pages link to <i>Computational Complexity</i>: On the Geometry of Polynomials and a Theory of Cost: II (Q3028211):
Displaying 27 items.
- Smale's mean value conjecture for finite Blaschke products (Q525417) (← links)
- Topological complexity of a root finding algorithm (Q582007) (← links)
- Globally convergent, iterative path-following for algebraic equations (Q655158) (← links)
- Critical points and values of complex polynomials (Q804635) (← links)
- Geometric function theory and Smale's mean value conjecture (Q883658) (← links)
- Average case optimality (Q1071513) (← links)
- Optimal solution of nonlinear equations (Q1086985) (← links)
- Algebraic complexity of computing polynomial zeros (Q1095599) (← links)
- Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004) (← links)
- A probabilistic theory for error estimation in automatic integration (Q1116644) (← links)
- Statistical complexity of the power method for Markov chains (Q1122306) (← links)
- On zero finding methods of higher order from data at one point (Q1122311) (← links)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
- Complexity of Bezout's theorem. V: Polynomial time (Q1338222) (← links)
- Semialgebraic complexity of functions (Q1763427) (← links)
- Improved two-step Newton's method for computing simple multiple zeros of polynomial systems (Q2163445) (← links)
- Dual mean value problem for complex polynomials (Q2268714) (← links)
- Point estimation of simultaneous methods for solving polynomial equations: A survey. II. (Q2372910) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- On the average number of steps of the simplex method of linear programming (Q3040925) (← links)
- Geometry of polynomials and root-finding via path-lifting (Q4606640) (← links)
- Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra (Q4918038) (← links)
- On isolation of simple multiple zeros and clusters of zeros of polynomial systems (Q5207445) (← links)
- On the efficient global dynamics of Newton’s method for complex polynomials (Q5872372) (← links)
- Extremal problems in geometric function theory (Q6072000) (← links)
- Newton's method in practice. II: The iterated refinement Newton method and near-optimal complexity for finding all roots of some polynomials of very large degrees (Q6073133) (← links)
- Flow box decomposition for gradients of univariate polynomials, billiards on the Riemann sphere, tree-like configurations of vanishing cycles for \(A_{n}\) curve singularities and geometric cluster monodromy (Q6150001) (← links)
