Gregorio Malajovich Munoz

Instituição:

Universidade Federal do Rio de Janeiro

Centro:

Centro de Ciências Matemáticas e da Natureza

Unidade:

Instituto de Matemática

Departamento:

Departamento de Matemática Aplicada/I Mat

e-mail:

gregorio@im.ufrj.br

Linkedin:

Google Scholar:

7Mu5PqsAAAAJ

ORCID:

não disponível no Lattes

Formação:
  • City University Of Hong Kong

    | Pós-Doutorado | 1999 - 2001
  • Mathematical Sciences Research Institute Berkeley Ca

    | Pós-Doutorado | 1998 - 1999
  • University Of California At Berkeley

    Mathematics | Doutorado | 1991 - 1993
  • Universidade Federal do Rio de Janeiro

    Matemática Aplicada | Mestrado | 1989 - 1990
  • Universidade Federal do Rio de Janeiro

    Matematico | Graduação | 1987 - 1989
  • Universidade de São Paulo

    | Livre Docência | 0 - Agora
  • Universidade Estadual de Campinas

    | Livre Docência | 0 - Agora
Laboratórios:
Nenhum laboratório cadastrado
Nuvens de Palavras:
Artigos:

(100.00% artigos com DOI)

Titulo DOI Ano
On the expected number of real roots of polynomials and exponential sums 10.1016/j.jco.2022.101720 2022
Complexity of sparse polynomial solving 2: renormalization 10.1093/imanum/drac039 2022
A Theory of NP-completeness and Ill-conditioning for Approximate Real Computations 10.1145/3321479 2019
Complexity of Sparse Polynomial Solving: Homotopy on Toric Varieties and the Condition Metric 10.1007/s10208-018-9375-2 2018
Computing Mixed Volume and All Mixed Cells in Quermassintegral Time 10.1007/s10208-016-9320-1 2017
Adaptive step-size selection for homotopy methods to solve polynomial equations 10.1093/imanum/drs007 2013
On the Expected Number of Zeros of Nonlinear Equations 10.1007/s10208-013-9171-y 2013
A numerical algorithm for zero counting. III: Randomization and condition 10.1016/j.aam.2011.07.001 2012
Convexity Properties of the Condition Number II 10.1137/100808885 2012
Convexity Properties of the Condition Number 10.1137/080718681 2010
A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis 10.1007/s11784-009-0127-4 2009
On the number of minima of a random polynomial? 10.1016/j.jco.2007.09.003 2008
A numerical algorithm for zero counting, I: Complexity and accuracy 10.1016/j.jco.2008.03.001 2008
Computing Minimal Multi-Homogeneous Bezout Numbers Is Hard 10.1007/s00224-006-1322-y 2007
On the Curvature of the Central Path of Linear Programming Theory 10.1007/s10208-003-0116-8 2005
High probability analysis of the condition number of sparse polynomial systems 10.1016/j.tcs.2004.01.006 2004
Newton Method on Riemannian Manifolds: Covariant Alpha-Theory, 10.1093/imanum/23.3.395 2003
Lower bounds for some decision problems over ? 10.1016/S0304-3975(01)00273-0 2002
On the Geometry of Graeffe Iteration 10.1006/jcom.2001.0585 2001
On the Complexity of Computing Error Bounds 10.1007/s10208001004 2001
Tangent Graeffe iteration 10.1007/s002110100278 2001
On a Transfer Theorem for the ≠ Conjecture 10.1006/jcom.2000.0568 2001
Condition Number Bounds for Problems with Integer Coefficients 10.1006/jcom.2000.0552 2000
On the Structure of $cal NP_Bbb C$ 10.1137/S0097539795294980 1998
A fast and stable algorithm for splitting polynomials 10.1016/S0898-1221(96)00233-7 1997
On generalized Newton algorithms: quadratic convergence, path-following and error analysis 10.1016/0304-3975(94)00065-4 1994
Eventos:

(0.00% eventos com DOI)

Titulo DOI Ano
Self-convexity 2013
Newton iteration, conditioning and zero counting 2013
Computing minimal multi-homogeneous Bézout numbers is hard 2005
Computing Multi-Homogeneous Bézout Numbers is Hard 2004
On the curvature of the Central Path of Linear Programming Theory 2004
Polynomial Systems and the Momentum Map 2002
On the Geometry of Graeffe Iteration 1998
On the Geometry of Graeffe Iteration 1997
A fast and Stable Algorithm for Splitting Polynomials 1995
On the Structure of NP_C 1995
Worst possible condition number of polynomial systems 1995
On Generalized Newton Algorithms: quadratic convergence, path-following and error analysis. 1994
On the Complexity of path-following Newton algorithms for solving systems of polynomial equations with integer coefficients (Abstract) 1993
Erro Numerico e Computabilidade em Sistemas Dinamicos 1990
Publicações:
Minha Rede: