Steve Smale - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2017

The Pitchfork BifurcationIndika Rajapakse, Steve Smale. IJBC, 27(9):1-5, 2017. [doi]

Mathematics of the GenomeIndika Rajapakse, Steve Smale. focm, 17(5):1195-1217, 2017. [doi]

2012

Hodge Theory on Metric SpacesLaurent Bartholdi, Thomas Schick, Nat Smale, Steve Smale. focm, 12(1):1-48, 2012. [doi]

2011

Mathematical and Computational Foundations of Learning Theory (Dagstuhl Seminar 11291)Matthias Hein, Gábor Lugosi, Lorenzo Rosasco, Steve Smale. dagstuhl-reports, 1(7):53-69, 2011. [doi]

2010

Mathematics of the Neural ResponseSteve Smale, Lorenzo Rosasco, Jake V. Bouvrie, Andrea Caponnetto, Tomaso Poggio. focm, 10(1):67-91, 2010. [doi]

2007

Risk Bounds for Random Regression GraphsAndrea Caponnetto, Steve Smale. focm, 7(4):495-528, 2007. [doi]

Emergent Behavior in FlocksFelipe Cucker, Steve Smale. tac, 52(5):852-862, 2007. [doi]

Smale horseshoeSteve Smale, Michael Shub. scholarpedia, 2(11):3012, 2007. [doi]

2006

Online Learning AlgorithmsSteve Smale, Yuan Yao. focm, 6(2):145-170, 2006. [doi]

2004

Modeling Language EvolutionFelipe Cucker, Steve Smale, Ding-Xuan Zhou. focm, 4(3):315-343, 2004. [doi]

2002

Best Choices for Regularization Parameters in Learning Theory: On the Bias-Variance ProblemFelipe Cucker, Steve Smale. focm, 2(4):413-428, 2002. [doi]

1999

Complexity Estimates Depending on Condition and Round-Off ErrorFelipe Cucker, Steve Smale. JACM, 46(1):113-184, 1999. [doi]

A Polynomial Time Algorithm for Diophantine Equations in One VariableFelipe Cucker, Pascal Koiran, Steve Smale. JSC, 27(1):21-29, 1999.

1998

Complexity Estimates Depending on Condition and Round-Off ErrorFelipe Cucker, Steve Smale. esa 1998: 115-126 [doi]

Some Lower Bounds for the Complexity of Continuation MethodsJean-Pierre Dedieu, Steve Smale. jc, 14(4):454-465, 1998. [doi]

1994

Separation of Complexity Classes in Koiran s Weak ModelFelipe Cucker, Mike Shub, Steve Smale. TCS, 133(1):3-14, 1994.

Complexity of Bezout s Theorem V: Polynomial TimeMike Shub, Steve Smale. TCS, 133(1):141-164, 1994.

1993

Complexity of Bezout s Theorem: III. Condition Number and PackingMichael Shub, Steve Smale. jc, 9(1):4-14, 1993. [doi]

1990

Some Remarks on the Foundations of Numerical AnalysisSteve Smale. siamrev, 32(2):211-220, 1990. [doi]

1988

On a Theory of Computation over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines (Extended Abstract)Lenore Blum, Mike Shub, Steve Smale. focs 1988: 387-397

1987

On the topology of algorithms, ISteve Smale. jc, 3(2):81-89, 1987. [doi]

1986

On the existence of generally convergent algorithmsMichael Shub, Steve Smale. jc, 2(1):2-11, 1986. [doi]

Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: IIMike Shub, Steve Smale. SICOMP, 15(1):145-161, 1986.

1983

On the average number of steps of the simplex method of linear programmingSteve Smale. mp, 27(3):241-262, 1983. [doi]

1982

The Problem of the Average Speed of the Simplex MethodSteve Smale. ismp 1983: 530-539 [doi]

Sign in or sign up to see more results.

runs on WebDSL