2007 |
16 | EE | Andrea Caponnetto,
Steve Smale:
Risk Bounds for Random Regression Graphs.
Foundations of Computational Mathematics 7(4): 495-528 (2007) |
15 | EE | Steve Smale,
Michael Shub:
Smale horseshoe.
Scholarpedia 2(11): 3012 (2007) |
2006 |
14 | EE | Steve Smale,
Yuan Yao:
Online Learning Algorithms.
Foundations of Computational Mathematics 6(2): 145-170 (2006) |
2004 |
13 | EE | Felipe Cucker,
Steve Smale,
Ding-Xuan Zhou:
Modeling Language Evolution.
Foundations of Computational Mathematics 4(3): 315-343 (2004) |
2002 |
12 | EE | Felipe Cucker,
Steve Smale:
Best Choices for Regularization Parameters in Learning Theory: On the Bias-Variance Problem.
Foundations of Computational Mathematics 2(4): 413-428 (2002) |
1999 |
11 | EE | Felipe Cucker,
Steve Smale:
Complexity Estimates Depending on Condition and Round-Off Error.
J. ACM 46(1): 113-184 (1999) |
10 | | Felipe Cucker,
Pascal Koiran,
Steve Smale:
A Polynomial Time Algorithm for Diophantine Equations in One Variable.
J. Symb. Comput. 27(1): 21-29 (1999) |
1998 |
9 | EE | Felipe Cucker,
Steve Smale:
Complexity Estimates Depending on Condition and Round-Off Error.
ESA 1998: 115-126 |
8 | EE | Jean-Pierre Dedieu,
Steve Smale:
Some Lower Bounds for the Complexity of Continuation Methods.
J. Complexity 14(4): 454-465 (1998) |
1994 |
7 | | Mike Shub,
Steve Smale:
Complexity of Bezout's Theorem V: Polynomial Time.
Theor. Comput. Sci. 133(1): 141-164 (1994) |
6 | | Felipe Cucker,
Mike Shub,
Steve Smale:
Separation of Complexity Classes in Koiran's Weak Model.
Theor. Comput. Sci. 133(1): 3-14 (1994) |
1993 |
5 | EE | Michael Shub,
Steve Smale:
Complexity of Bezout's Theorem: III. Condition Number and Packing.
J. Complexity 9(1): 4-14 (1993) |
1988 |
4 | | Lenore Blum,
Mike Shub,
Steve Smale:
On a Theory of Computation over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines (Extended Abstract)
FOCS 1988: 387-397 |
1987 |
3 | EE | Steve Smale:
On the topology of algorithms, I.
J. Complexity 3(2): 81-89 (1987) |
1986 |
2 | EE | Michael Shub,
Steve Smale:
On the existence of generally convergent algorithms.
J. Complexity 2(1): 2-11 (1986) |
1 | | Mike Shub,
Steve Smale:
Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II.
SIAM J. Comput. 15(1): 145-161 (1986) |