Gregorio Malajovich

According to our database, Gregorio Malajovich authored at least 29 papers between 1994 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2025

Complexity of sparse polynomial solving 3: Infinity.

Gregorio Malajovich

CoRR, June, 2025

2023

On the expected number of real roots of polynomials and exponential sums.

Gregorio Malajovich

J. Complex., June, 2023

2020

Complexity of Sparse Polynomial Solving 2: Renormalization.

Gregorio Malajovich

CoRR, 2020

2019

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

Gregorio Malajovich, Mike Shub

J. ACM, 2019

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

Gregorio Malajovich

Found. Comput. Math., 2019

2017

Computing Mixed Volume and All Mixed Cells in Quermassintegral Time.

Gregorio Malajovich

Found. Comput. Math., 2017

2013

On the Expected Number of Zeros of Nonlinear Equations.

Gregorio Malajovich

Found. Comput. Math., 2013

2012

Convexity Properties of the Condition Number II.

Carlos Beltrán, Jean-Pierre Dedieu, Gregorio Malajovich, Mike Shub

SIAM J. Matrix Anal. Appl., 2012

A numerical algorithm for zero counting. III: Randomization and condition.

Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor

Adv. Appl. Math., 2012

2011

Adaptative Step Size Selection for Homotopy Methods to Solve Polynomial Equations

Jean-Pierre Dedieu, Gregorio Malajovich, Michael Shub

CoRR, 2011

2009

Convexity Properties of the Condition Number.

Carlos Beltrán, Jean-Pierre Dedieu, Gregorio Malajovich, Mike Shub

SIAM J. Matrix Anal. Appl., 2009

A Numerical Algorithm for Zero Counting. II: Distance to Ill-posedness and Smoothed Analysis

Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor

CoRR, 2009

2008

On the number of minima of a random polynomial.

Jean-Pierre Dedieu, Gregorio Malajovich

J. Complex., 2008

A numerical algorithm for zero counting, I: Complexity and accuracy.

Felipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor

J. Complex., 2008

Guest Editor's Preface.

Peter Bürgisser, Andrei Gabrielov, Teresa Krick, Gregorio Malajovich

J. Complex., 2008

2005

Guest editors' preface.

Askold Khovanskii, Pascal Koiran, Teresa Krick, Gregorio Malajovich, Joseph F. Traub

J. Complex., 2005

On the Curvature of the Central Path of Linear Programming Theory.

Jean-Pierre Dedieu, Gregorio Malajovich, Mike Shub

Found. Comput. Math., 2005

Computing Minimal Multi-homogeneous Bézout Numbers Is Hard.

Gregorio Malajovich, Klaus Meer

Proceedings of the STACS 2005, 2005

2004

High probability analysis of the condition number of sparse polynomial systems.

Gregorio Malajovich, J. Maurice Rojas

Theor. Comput. Sci., 2004

Computing Multi-Homogeneous Bezout Numbers is Hard

Gregorio Malajovich, Klaus Meer

CoRR, 2004

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

Klaus Meer, Gregorio Malajovich

Proceedings of the Algorithms and Complexity for Continuous Problems, 26. September, 2004

2002

Lower bounds for some decision problems over C.

Gregorio Malajovich

Theor. Comput. Sci., 2002

2001

Tangent Graeffe iteration.

Gregorio Malajovich, Jorge P. Zubelli

Numerische Mathematik, 2001

On the Geometry of Graeffe Iteration.

Gregorio Malajovich, Jorge P. Zubelli

J. Complex., 2001

On a Transfer Theorem for the P != NP Conjecture.

Gregorio Malajovich

J. Complex., 2001

On the Complexity of Computing Error Bounds.

James Demmel, Benjamin Diament, Gregorio Malajovich

Found. Comput. Math., 2001

2000

Condition Number Bounds for Problems with Integer Coefficients.

Gregorio Malajovich

J. Complex., 2000

1998

On the Structure of NP_C.

Gregorio Malajovich, Klaus Meer

SIAM J. Comput., 1998

1994

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

Gregorio Malajovich

Theor. Comput. Sci., 1994