Fields of interest:
- Complexity and Computation
T. Poggio, S. Smale:
The mathematics of learning: dealing with data.
In: W. Chu et al. (Ed.): Foundations and advances in data mining.
Studies in Fuzziness and Soft Computing 180, Springer, Berlin, 2005, pp. 3-19.
S. Smale, D.-Y. Zhou:
Shannon sampling. II: Connections to learning theory.
Appl. Comput. Harmon. Anal., Vol. 19(3), (2005), pp. 285-302.
On problems of computational complexity.
In: V. Prasolov et al. (Ed.): Surveys in modern mathematics.
London Mathematical Society Lecture Note Series 321, The Independent University of Moscow Seminars, (2005), pp. 255-259.
S. Smale, L. Blum, F. Cucker, M. Shub:
Algebraic Settings for the Problem "P=NP"
Lectures in Applied Mathematics, to appear
Chaos: Finding a Horseshoe on the Beaches of Rio
F. Cucker, P. Koiran, S. Smale:
A Polynomial Time Algorithm for Diophantine Equations in One Variable
J. Symbolic Computation, Vol 27, (1999), pp. 21-29.
F. Cucker, S. Smale:
Complexity Estimates Depending on Condition and Round-off Error
J. Assoc. Comp. Machinery, Vol 46, (1999), pp. 113-184.
J.-P. Dedieu, S. Smale:
Some Lower Bounds for the Complexity of Continuation Methods
J. Complexity, Vol 14, (1998), 454-465.
L. Blum, F. Cucker, M. Shub, S. Smale:
Complexity and real computation, Springer-Verlag, 1998.