Mike Shub

Publication Activity (10 Years)

Years Active: 1982-2019
Publications (10 Years): 2

Top Topics

Bregman Divergences

Theoretical Framework

Convexity Properties

Top Venues

SIAM J. Matrix Anal. Appl.

Publications

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