Gregorio Malajovich

Orcid: 0000-0001-8456-3959

Affiliations:
  • Federal University of Rio de Janeiro, Brazil


According to our database1, Gregorio Malajovich authored at least 28 papers between 1994 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On the expected number of real roots of polynomials and exponential sums.
J. Complex., June, 2023

2020
Complexity of Sparse Polynomial Solving 2: Renormalization.
CoRR, 2020

2019
A Theory of NP-completeness and Ill-conditioning for Approximate Real Computations.
J. ACM, 2019

Complexity of Sparse Polynomial Solving: Homotopy on Toric Varieties and the Condition Metric.
Found. Comput. Math., 2019

2017
Computing Mixed Volume and All Mixed Cells in Quermassintegral Time.
Found. Comput. Math., 2017

2013
On the Expected Number of Zeros of Nonlinear Equations.
Found. Comput. Math., 2013

2012
Convexity Properties of the Condition Number II.
SIAM J. Matrix Anal. Appl., 2012

A numerical algorithm for zero counting. III: Randomization and condition.
Adv. Appl. Math., 2012

2011
Adaptative Step Size Selection for Homotopy Methods to Solve Polynomial Equations
CoRR, 2011

2009
Convexity Properties of the Condition Number.
SIAM J. Matrix Anal. Appl., 2009

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

2008
On the number of minima of a random polynomial.
J. Complex., 2008

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

Guest Editor's Preface.
J. Complex., 2008

2007
Computing Minimal Multi-Homogeneous Bezout Numbers Is Hard.
Theory Comput. Syst., 2007

2005
Guest editors' preface.
J. Complex., 2005

On the Curvature of the Central Path of Linear Programming Theory.
Found. Comput. Math., 2005

2004
High probability analysis of the condition number of sparse polynomial systems.
Theor. Comput. Sci., 2004

Computing Multi-Homogeneous Bezout Numbers is Hard
CoRR, 2004

On the Complexity of Computing Multi-Homogeneous Bézout Numbers.
Proceedings of the Algorithms and Complexity for Continuous Problems, 26. September, 2004

2002
Lower bounds for some decision problems over C.
Theor. Comput. Sci., 2002

2001
Tangent Graeffe iteration.
Numerische Mathematik, 2001

On the Geometry of Graeffe Iteration.
J. Complex., 2001

On a Transfer Theorem for the P != NP Conjecture.
J. Complex., 2001

On the Complexity of Computing Error Bounds.
Found. Comput. Math., 2001

2000
Condition Number Bounds for Problems with Integer Coefficients.
J. Complex., 2000

1998
On the Structure of NP_C.
SIAM J. Comput., 1998

1994
On Generalized Newton Algorithms: Quadratic Convergence, Path-Following and Error Analysis.
Theor. Comput. Sci., 1994


  Loading...