Searching for authors named Steve Smale – sorted by Relevance.
-
Complexity Theory and Numerical Analysis
- Complexity Theory and Numerical Analysis Steve Smale y November 4, 1996 0 Preface Section 5
- Cited by 13 (0 self) – Add To MetaCart
-
Mathematical Problems for the Next Century
- Mathematical Problems for the Next Century 1 Steve Smale Department of Mathematics City
- Cited by 26 (1 self) – Add To MetaCart
-
Complexity of Bezout's theorem V: Polynomial time
- Yorktwn Heights, NY-10598-0218 e-mail: shub@(email omitted); Steve Smale Mathematics Department University
- Cited by 33 (3 self) – Add To MetaCart
-
Online learning algorithms
- Online Learning Algorithms ∗ Steve Smale Toyota Technological Institute at Chicago 1427 East 60th
- Cited by 5 (1 self) – Add To MetaCart
-
NP and Mathematics - a computational complexity perspective
- gift to mathematics from Computer Science” Steve Smale. Abstract. The P versus N P question
- Cited by 1 (0 self) – Add To MetaCart
-
On the intractability of Hilbert's Nullstellensatz and an algebraic version
- @(email omitted); Steve Smale Department of Mathematics University of California at Berkeley Berkeley, CA 94720 smale
- Cited by 17 (0 self) – Add To MetaCart
-
Complexity Of Bezout's Theorem IV: Probability Of Success; Extensions
- COMPLEXITY OF BEZOUT'S THEOREM IV: PROBABILITY OF SUCCESS; EXTENSIONS Michael Shub 1 and Steve
- Cited by 37 (8 self) – Add To MetaCart
-
The mathematics of learning: Dealing with data
- December 16, 2002 The Mathematics of Learning: Dealing with Data Tomaso Poggio and Steve Smale
- Cited by 52 (4 self) – Add To MetaCart
-
On the mathematics of emergence
- Kong 83 Tat Chee Avenue, Kowloon HONG KONG e-mail: macucker@(email omitted); Steve Smale † Toyota
- Cited by 3 (1 self) – Add To MetaCart
-
On the mathematical foundations of learning
- CUCKER AND STEVE SMALE Introduction The problem of learning is arguably at the very core of the problem
- Cited by 120 (3 self) – Add To MetaCart

