Abstract
In the preceding chapter we described Smale’s 17th problem and a probabilistic solution for it, namely, a randomized algorithm whose average cost is polynomially bounded. Here we continue with this theme, adding further understanding of the behavior of the homotopy algorithm described in the previous chapter. Also, getting closer to the original formulation of Smale’s problem, this chapter exhibits a deterministic algorithm whose average cost is nearly polynomial.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bürgisser, P., Cucker, F. (2013). Smale’s 17th Problem: II. In: Condition. Grundlehren der mathematischen Wissenschaften, vol 349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38896-5_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-38896-5_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38895-8
Online ISBN: 978-3-642-38896-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)