Mike Shub

19 papers A* 3Journal 16
YearRankTypeTitle / Venue / Authors
2019 J jnl
A Theory of NP-completeness and Ill-conditioning for Approximate Real Computations.
J. ACM
Gregorio Malajovich, Mike Shub
2018 J jnl
A theory of NP-completeness and ill-conditioning for approximate real computations.
CoRR
Gregorio Malajovich, Mike Shub
2012 J jnl
Convexity Properties of the Condition Number II.
SIAM J. Matrix Anal. Appl.
Carlos Beltrán, Jean-Pierre Dedieu, Gregorio Malajovich, Mike Shub
2009 J jnl
Convexity Properties of the Condition Number.
SIAM J. Matrix Anal. Appl.
Carlos Beltrán, Jean-Pierre Dedieu, Gregorio Malajovich, Mike Shub
2005 J jnl
Newton Flow and interior Point Methods in Linear Programming.
Int. J. Bifurc. Chaos
Jean-Pierre Dedieu, Mike Shub
2005 J jnl
On the Curvature of the Central Path of Linear Programming Theory.
Found. Comput. Math.
Jean-Pierre Dedieu, Gregorio Malajovich, Mike Shub
2001 J jnl
Editorial.
Found. Comput. Math.
Mike Shub
2001 J jnl
On simple double zeros and badly conditioned zeros of analytic functions of n variables.
Math. Comput.
Jean-Pierre Dedieu, Mike Shub
2000 J jnl
Multihomogeneous Newton methods.
Math. Comput.
Jean-Pierre Dedieu, Mike Shub
2000 J jnl
Newton's method for overdetermined systems of equations.
Math. Comput.
Jean-Pierre Dedieu, Mike Shub
1996 J jnl
Generalized Knapsack Problems and Fixed Degree Separations.
Theor. Comput. Sci.
Felipe Cucker, Mike Shub
1994 J jnl
Complexity of Bezout's Theorem V: Polynomial Time.
Theor. Comput. Sci.
Mike Shub, Steve Smale
1994 J jnl
Separation of Complexity Classes in Koiran's Weak Model.
Theor. Comput. Sci.
Felipe Cucker, Mike Shub, Steve Smale
1988 A* conf
On a Theory of Computation over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines (Extended Abstract)
FOCS
Lenore Blum, Mike Shub, Steve Smale
1986 J jnl
A Simple Unpredictable Pseudo-Random Number Generator.
SIAM J. Comput.
Lenore Blum, Manuel Blum, Mike Shub
1986 J jnl
Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II.
SIAM J. Comput.
Mike Shub, Steve Smale
1986 J jnl
Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average.
SIAM J. Comput.
Lenore Blum, Mike Shub
1984 A* conf
Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average (Extended Abstract)
FOCS
Lenore Blum, Mike Shub
1982 A* conf
Comparison of Two Pseudo-Random Number Generators.
CRYPTO
Lenore Blum, Manuel Blum, Mike Shub