![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 15 | Steve Smale, Michael Shub: Smale horseshoe. Scholarpedia 2(11): 3012 (2007) | |
| 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) | |
| 5 | Michael Shub, Steve Smale: Complexity of Bezout's Theorem: III. Condition Number and Packing. J. Complexity 9(1): 4-14 (1993) | |
| 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 | |
| 2 | 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) |
Selection of 7 from 16 records - Steve Smale has 8 coauthors
Copyright © 2009-12-01 by Michael Ley (ley@uni-trier.de)