Pages that link to "Item:Q582007"
From MaRDI portal
The following pages link to Topological complexity of a root finding algorithm (Q582007):
Displaying 4 items.
- On the distance to the zero set of a homogeneous polynomial (Q582323) (← links)
- Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine (Q1128664) (← links)
- Smale’s 17th problem: Average polynomial time to compute affine and projective solutions (Q3079201) (← links)
- On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined case (Q3433761) (← links)
