Pages that link to "Item:Q3028211"

The following pages link to <i>Computational Complexity</i>: On the Geometry of Polynomials and a Theory of Cost: II (Q3028211):

Displaying 39 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)
• On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial (Q3477120) (← links)
• SMALE’S PROBLEM FOR CRITICAL POINTS ON CERTAIN TWO RAYS (Q3560279) (← links)
• On the cost of approximating all roots of a complex polynomial (Q3698169) (← links)
• On the efficiency of algorithms of analysis (Q3721699) (← links)
• Recent developments in information-based complexity (Q3780359) (← links)
• Approximate Zeros of Quadratically Convergent Algorithms (Q4305971) (← 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)
• A short survey on Kantorovich (Q5270188) (← links)
• How to be sure of finding a root of a complex polynomial using Newton's method (Q5285715) (← links)
• Smale’s mean value conjecture and the coefficients of univalent functions (Q5295113) (← links)
• On the efficient global dynamics of Newton’s method for complex polynomials (Q5872372) (← links)
• Kronecker's and Newton's approaches to solving: a first comparison (Q5938585) (← links)
• Point estimation of simultaneous methods for solving polynomial equations: A survey (Q5948584) (← links)
• On critical values of polynomials with real critical points (Q5962344) (← 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)