The SCEAS System
| |||||||

## Search the dblp DataBase
Steve Smale:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Felipe Cucker, Steve Smale
**Complexity Estimates Depending on Condition and Round-Off Error.**[Citation Graph (0, 0)][DBLP] ESA, 1998, pp:115-126 [Conf] - Lenore Blum, Mike Shub, Steve Smale
**On a Theory of Computation over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines (Extended Abstract)**[Citation Graph (0, 0)][DBLP] FOCS, 1988, pp:387-397 [Conf] - Felipe Cucker, Steve Smale
**Best Choices for Regularization Parameters in Learning Theory: On the Bias-Variance Problem.**[Citation Graph (0, 0)][DBLP] Foundations of Computational Mathematics, 2002, v:2, n:4, pp:413-428 [Journal] - Felipe Cucker, Steve Smale, Ding-Xuan Zhou
**Modeling Language Evolution.**[Citation Graph (0, 0)][DBLP] Foundations of Computational Mathematics, 2004, v:4, n:3, pp:315-343 [Journal] - Steve Smale, Yuan Yao
**Online Learning Algorithms.**[Citation Graph (0, 0)][DBLP] Foundations of Computational Mathematics, 2006, v:6, n:2, pp:145-170 [Journal] - Felipe Cucker, Steve Smale
**Complexity Estimates Depending on Condition and Round-Off Error.**[Citation Graph (0, 0)][DBLP] J. ACM, 1999, v:46, n:1, pp:113-184 [Journal] - Jean-Pierre Dedieu, Steve Smale
**Some Lower Bounds for the Complexity of Continuation Methods.**[Citation Graph (0, 0)][DBLP] J. Complexity, 1998, v:14, n:4, pp:454-465 [Journal] - Michael Shub, Steve Smale
**Complexity of Bezout's Theorem: III. Condition Number and Packing.**[Citation Graph (0, 0)][DBLP] J. Complexity, 1993, v:9, n:1, pp:4-14 [Journal] - Steve Smale
**On the topology of algorithms, I.**[Citation Graph (0, 0)][DBLP] J. Complexity, 1987, v:3, n:2, pp:81-89 [Journal] - Michael Shub, Steve Smale
**On the existence of generally convergent algorithms.**[Citation Graph (0, 0)][DBLP] J. Complexity, 1986, v:2, n:1, pp:2-11 [Journal] - Felipe Cucker, Pascal Koiran, Steve Smale
**A Polynomial Time Algorithm for Diophantine Equations in One Variable.**[Citation Graph (0, 0)][DBLP] J. Symb. Comput., 1999, v:27, n:1, pp:21-29 [Journal] - Mike Shub, Steve Smale
**Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1986, v:15, n:1, pp:145-161 [Journal] - Felipe Cucker, Mike Shub, Steve Smale
**Separation of Complexity Classes in Koiran's Weak Model.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1994, v:133, n:1, pp:3-14 [Journal] - Mike Shub, Steve Smale
**Complexity of Bezout's Theorem V: Polynomial Time.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1994, v:133, n:1, pp:141-164 [Journal]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |