Complexity of bezout’s theorem. I: Geometric aspects
- Michael Shub
- Steve Smale
- 1993
- Journal of the American Mathematical Society
Publications
Date
Featured collections
Popular topics
10 results for Steve Smale
On a theory of computation and complexity over the real numbers: Np-completeness, recursive functions and universal machines
- Lenore Blum
- Mike Shub
- et al.
- 1989
- Bulletin of the American Mathematical Society
Genome Architecture Mediates Transcriptional Control of Human Myogenic Reprogramming
- Sijia Liu
- Haiming Chen
- et al.
- 2018
- iScience
Complexity and real computation: A manifesto
- Lenore Blum
- Felipe Cucker
- et al.
- 1996
- International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
Complexity of Bezout's theorem IV: Probability of success; extensions
- Michael Shub
- Steve Smale
- 1996
- SIAM Journal on Numerical Analysis
On the intractability of hilbert’s nullstellensatz and an algebraic version of "NP ≠ p?"
- Michael Shub
- Steve Smale
- 1995
- Duke Mathematical Journal
Complexity of Bezout's theorem V: polynomial time
- M. Shub
- S. Smale
- 1994
- Theoretical Computer Science
Separation of complexity classes in Koiran's weak model
- F. Cucker
- M. Shub
- et al.
- 1994
- Theoretical Computer Science
Complexity of Bezout’s Theorem. III. Condition Number and Packing
- Michael Shub
- Steve Smale
- 1993
- Journal of Complexity
On the existence of generally convergent algorithms
- Michael Shub
- Steve Smale
- 1986
- Journal of Complexity