G. Malajovich

发表

Newton's method on Riemannian manifolds: covariant alpha theory

P. Priouret, J. Dedieu, G. Malajovich, 2002, math/0209096.

On the Geometry of Grae e IterationGregorio MalajovichDep

G. Malajovich, J. Zubelli, 1998 .

A fast and stable algorithm for splitting polynomials

G. Malajovich, J. Zubelli, 1997 .

WORST POSSIBLE CONDITION NUMBER OF POLYNOMIAL SYSTEMS

Gregorio Malajovich, G. Malajovich, 2001 .

Newton iteration, conditioning and zero counting

G. Malajovich, 2012, 1211.2120.

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

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

Mathematics Sector : Applied Mathematics Research group : Complexity and Foundations of Computational Mathematics

Felipe Bottega Diniz, F. Cucker, J. Dedieu, 2013 .

N A ] 1 3 D ec 2 00 0 Random Sparse Polynomial Systems

J. M. Rojas, G. Malajovich, J. Rojas, 2000 .

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

G. Malajovich, 2019 .

Complexity of Sparse Polynomial Solving 2: Renormalization

G. Malajovich, 2020, ArXiv.

Condition Number Bounds for Problems with Integer Coefficients

G. Malajovich, 1999, J. Complex..

High probability analysis of the condition number of sparse polynomial systems

J. M. Rojas, G. Malajovich, Maurice Rojas, 2002, Theor. Comput. Sci..

Random Sparse Polynomial Systems

J. M. Rojas, G. Malajovich, J. Rojas, 2000, math/0012104.

On the Geometry of Graeffe Iteration

G. Malajovich, J. Zubelli, 1999, J. Complex..

Tangent Graeffe iteration

G. Malajovich, J. Zubelli, 1999, Numerische Mathematik.

Lower bounds for some decision problems over C

G. Malajovich, 1999, Theor. Comput. Sci..

Ultimate Polynomial Time

G. Malajovich, 1999, math/9904130.

On the structure ofNPC y

G. Malajovich, 2001 .

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

G. Malajovich, 2022, 2204.06081.

On the number of minima of a random polynomial

J. Dedieu, G. Malajovich, 2007, J. Complex..

Computing Mixed Volume and All Mixed Cells in Quermassintegral Time

G. Malajovich, 2016, Foundations of Computational Mathematics.

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

G. Malajovich, 2018, Foundations of Computational Mathematics.

Computing Mixed Volume and All Mixed Cells in Quermassintegral Time

Gregorio Malajovich, G. Malajovich, 2014, 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.

On the Expected Number of Zeros of Nonlinear Equations

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

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

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

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

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

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

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

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

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

Convexity Properties of the Condition Number II

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

Convexity Properties of the Condition Number

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

On a Transfer Theorem for the P != NP Conjecture

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

On a Transfer Theorem for the P != NP Conjecture

G. Malajovich, 2001, J. Complex..

On the Structure of NP_C

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

On a Transfer Theorem for the P{NP Conjecture

G. Malajovich, 2001 .

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 Curvature of the Central Path of Linear Programming Theory

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

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

Gregorio Malajovich, G. Malajovich, 2001 .