Complexity of Bezout's theorem V: polynomial time
- M. Shub
- S. Smale
- 1994
- Theoretical Computer Science
Publications
Date
Featured collections
Popular topics
33 results for Michael Shub
Complexity of bezout’s theorem. I: Geometric aspects
- Michael Shub
- Steve Smale
- 1993
- Journal of the American Mathematical Society
Complexity of Bezout’s Theorem. III. Condition Number and Packing
- Michael Shub
- Steve Smale
- 1993
- Journal of Complexity
Unified complexity analysis for Newton LP methods
- James Renegar
- Michael Shub
- 1992
- Mathematical Programming
Test complexity of generic polynomials
- Peter Bürgisser
- Thomas Lickteig
- et al.
- 1992
- Journal of Complexity
On the distance to the zero set of a homogeneous polynomial
- Michael Shub
- 1989
- Journal of Complexity
Boundary behavior of interior point algorithms in linear programming
- Nimrod Megiddo
- M. Shub
- 1989
- Mathematics of Operations Research
Ergodic attractors
- Charles Pugh
- Michael Shub
- 1989
- Trans. Am. Math. Soc.
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
Cr Stability of periodic solutions and solution schemes
- Charles Pugh
- Michael Shub
- 1988
- Applied Mathematics Letters