Mike Shub - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 18 from 18

2019

A Theory of NP-completeness and Ill-conditioning for Approximate Real ComputationsGregorio Malajovich, Mike Shub. JACM, 66(4), 2019. [doi]

2012

Convexity Properties of the Condition Number IICarlos Beltrán, Jean-Pierre Dedieu, Gregorio Malajovich, Mike Shub. siammax, 33(3):905-939, 2012. [doi]

2009

Convexity Properties of the Condition NumberCarlos Beltrán, Jean-Pierre Dedieu, Gregorio Malajovich, Mike Shub. siammax, 31(3):1491-1506, 2009. [doi]

2005

Newton Flow and interior Point Methods in Linear ProgrammingJean-Pierre Dedieu, Mike Shub. IJBC, 15(3):827-839, 2005. [doi]

On the Curvature of the Central Path of Linear Programming TheoryJean-Pierre Dedieu, Gregorio Malajovich, Mike Shub. focm, 5(2):145-171, 2005. [doi]

2001

On simple double zeros and badly conditioned zeros of analytic functions of n variablesJean-Pierre Dedieu, Mike Shub. moc, 70(233):319-327, 2001.

EditorialMike Shub. focm, 1(1):1-2, 2001. [doi]

2000

Newton s method for overdetermined systems of equationsJean-Pierre Dedieu, Mike Shub. moc, 69(231):1099-1115, 2000.

Multihomogeneous Newton methodsJean-Pierre Dedieu, Mike Shub. moc, 69(231):1071-1098, 2000.

1996

Generalized Knapsack Problems and Fixed Degree SeparationsFelipe Cucker, Mike Shub. TCS, 161(1&2):301-306, 1996. [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.

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

1986

Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on AverageLenore Blum, Mike Shub. SICOMP, 15(2):384-398, 1986.

A Simple Unpredictable Pseudo-Random Number GeneratorLenore Blum, Manuel Blum, Mike Shub. SICOMP, 15(2):364-383, 1986.

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

1984

Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average (Extended Abstract)Lenore Blum, Mike Shub. focs 1984: 261-267

1982

Comparison of Two Pseudo-Random Number GeneratorsLenore Blum, Manuel Blum, Mike Shub. crypto 1982: 61-78

Sign in or sign up to see more results.

runs on WebDSL