Gregorio Malajovich

发表

On the Structure of NP_C

Klaus Meer, Gregorio Malajovich, G. Malajovich, 1999, SIAM J. Comput..

Convexity Properties of the Condition Number II

Michael Shub, Carlos Beltrán, Gregorio Malajovich, 2009, SIAM J. Matrix Anal. Appl..

Adaptative Step Size Selection for Homotopy Methods to Solve Polynomial Equations pdf

Michael Shub, Gregorio Malajovich, Jean-Pierre Dedieu, 2011, ArXiv.

Complexity of Sparse Polynomial Solving: Homotopy on Toric Varieties and the Condition Metric

Gregorio Malajovich, G. Malajovich, 2016, Found. Comput. Math..

On Generalized Newton Algorithms: Quadratic Convergence, Path-Following and Error Analysis

Gregorio Malajovich, G. Malajovich, 1994, Theor. Comput. Sci..

On the Complexity of Computing Multi-Homogeneous Bézout Numbers

Klaus Meer, Gregorio Malajovich, 2004, Algorithms and Complexity for Continuous Problems.

Computing Mixed Volume and All Mixed Cells in Quermassintegral Time

Gregorio Malajovich, G. Malajovich, 2014, Found. Comput. Math..

Complexity of Sparse Polynomial Solving 2: Renormalization pdf

Gregorio Malajovich, 2020, ArXiv.

Convexity Properties of the Condition Number

Michael Shub, Carlos Beltrán, Gregorio Malajovich, 2008, SIAM J. Matrix Anal. Appl..

A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis

Felipe Cucker, Teresa Krick, Mario Wschebor, 2009, ArXiv.

On the Curvature of the Central Path of Linear Programming Theory

Michael Shub, Gregorio Malajovich, Jean-Pierre Dedieu, 2003, Found. Comput. Math..

On the Geometry of Graeffe Iteration

Gregorio Malajovich, Jorge P. Zubelli, 2001, J. Complex..

A Numerical Algorithm for Zero Counting. I: Complexity and Accuracy pdf

Felipe Cucker, Teresa Krick, Mario Wschebor, 2007, J. Complex..

Guest Editor's Preface

Peter Bürgisser, Teresa Krick, Gregorio Malajovich, 2008, J. Complex..

Lower bounds for some decision problems over C

Gregorio Malajovich, 2002, Theor. Comput. Sci..

Condition Number Bounds for Problems with Integer Coefficients

Gregorio Malajovich, 2000, J. Complex..

High probability analysis of the condition number of sparse polynomial systems

Gregorio Malajovich, Maurice Rojas, 2004, Theor. Comput. Sci..

On a Transfer Theorem for the P != NP Conjecture

Gregorio Malajovich, G. Malajovich, 2001, J. Complex..

On the Expected Number of Zeros of Nonlinear Equations

Gregorio Malajovich, G. Malajovich, 2011, Found. Comput. Math..

Computing Multi-Homogeneous Bezout Numbers is Hard

Klaus Meer, Gregorio Malajovich, 2004, ArXiv.

On the Complexity of Computing Error Bounds

James Demmel, Gregorio Malajovich, Benjamin Diament, 2001, Found. Comput. Math..

Computing Minimal Multi-Homogeneous Bezout Numbers Is Hard

Klaus Meer, Gregorio Malajovich, G. Malajovich, 2004, Theory of Computing Systems.

Computing Minimal Multi-homogeneous Bézout Numbers Is Hard

Klaus Meer, Gregorio Malajovich, G. Malajovich, 2005, STACS.

A Theory of NP-completeness and Ill-conditioning for Approximate Real Computations

Michael Shub, Gregorio Malajovich, M. Shub, 2018, J. ACM.

On the number of minima of a random polynomial

Gregorio Malajovich, Jean-Pierre Dedieu, 2008, J. Complex..

Tangent Graeffe iteration

Gregorio Malajovich, Jorge P. Zubelli, 2001, Numerische Mathematik.

Guest editors' preface

Pascal Koiran, Joseph F. Traub, Teresa Krick, 2005, J. Complex..

A Numerical Algorithm for Zero Counting. III: Randomization and Condition

Felipe Cucker, Teresa Krick, Mario Wschebor, 2008, Adv. Appl. Math..

An Eective Version of Kronecker's Theorem on Simultaneous Diophantine Approximation

Gregorio Malajovich, G. Malajovich, 2001 .

On the structure of NPC

Klaus Meer, Gregorio Malajovich, 1999 .

WORST POSSIBLE CONDITION NUMBER OF POLYNOMIAL SYSTEMS

Gregorio Malajovich, G. Malajovich, 2001 .

Random Sparse Polynomial Systems

J. Maurice Rojas, Gregorio Malajovich, 2000 .

Polynomial Systems and the Momentum Map

J. Maurice Rojas, Gregorio Malajovich, 2001 .