1. C. Beltran and L. M. Pardo, Smale’s 17th problem: A probabilistic positive solution, Found. Comput. Math. 7 (2007), 87–134.
2. C. Beltran and L. M. Pardo, Smale’s 17th problem: Average polynomial time to compute affine and projective solutions. Preprint.
3. C. Beltran and M. Shub, Complexity of Bezout’s theorem VII: Distance estimates in the condition metric. Found. Comput. Math. (2008). doi: 10.1007/s10208-007-9018-5 .
4. M. Gromov, Metric Structures for Riemannian and Non-Riemannian Spaces, Birkhäuser, Basel, 1998.
5. L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and Real Computation, Springer, Berlin, 1998.