Gregorio Malajovich - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2023

On the expected number of real roots of polynomials and exponential sumsGregorio Malajovich. jc, 76:101720, June 2023. [doi]

2019

Complexity of Sparse Polynomial Solving: Homotopy on Toric Varieties and the Condition MetricGregorio Malajovich. focm, 19(1):1-53, 2019. [doi]

A Theory of NP-completeness and Ill-conditioning for Approximate Real ComputationsGregorio Malajovich, Mike Shub. JACM, 66(4), 2019. [doi]

2017

Computing Mixed Volume and All Mixed Cells in Quermassintegral TimeGregorio Malajovich. focm, 17(5):1293-1334, 2017. [doi]

2013

On the Expected Number of Zeros of Nonlinear EquationsGregorio Malajovich. focm, 13(6):867-884, 2013. [doi]

2012

Convexity Properties of the Condition Number IICarlos Beltrán, Jean-Pierre Dedieu, Gregorio Malajovich, Mike Shub. siammax, 33(3):905-939, 2012. [doi]

A numerical algorithm for zero counting. III: Randomization and conditionFelipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor. aam, 48(1):215-248, 2012. [doi]

2009

Convexity Properties of the Condition NumberCarlos Beltrán, Jean-Pierre Dedieu, Gregorio Malajovich, Mike Shub. siammax, 31(3):1491-1506, 2009. [doi]

2008

Guest Editor s PrefacePeter Bürgisser, Andrei Gabrielov, Teresa Krick, Gregorio Malajovich. jc, 24(1):2, 2008. [doi]

A numerical algorithm for zero counting, I: Complexity and accuracyFelipe Cucker, Teresa Krick, Gregorio Malajovich, Mario Wschebor. jc, 24(5-6):582-605, 2008. [doi]

On the number of minima of a random polynomialJean-Pierre Dedieu, Gregorio Malajovich. jc, 24(2):89-108, 2008. [doi]

2007

Computing Minimal Multi-Homogeneous Bezout Numbers Is HardGregorio Malajovich, Klaus Meer. mst, 40(4):553-570, 2007. [doi]

2005

On the Curvature of the Central Path of Linear Programming TheoryJean-Pierre Dedieu, Gregorio Malajovich, Mike Shub. focm, 5(2):145-171, 2005. [doi]

Guest editors prefaceAskold Khovanskii, Pascal Koiran, Teresa Krick, Gregorio Malajovich, Joseph F. Traub. jc, 21(1):4, 2005. [doi]

Computing Minimal Multi-homogeneous Bézout Numbers Is HardGregorio Malajovich, Klaus Meer. STACS 2005: 244-255 [doi]

2004

High probability analysis of the condition number of sparse polynomial systemsGregorio Malajovich, Maurice Rojas. TCS, 315(2-3):525-555, 2004. [doi]

On the Complexity of Computing Multi-Homogeneous Bézout NumbersKlaus Meer, Gregorio Malajovich. Dagstuhl 2005: [doi]

2002

Lower bounds for some decision problems over CGregorio Malajovich. TCS, 276(1-2):425-434, 2002. [doi]

2001

On the Complexity of Computing Error BoundsJames Demmel, B. Diament, Gregorio Malajovich. focm, 1(1):101-125, 2001. [doi]

On a Transfer Theorem for the P != NP ConjectureGregorio Malajovich. jc, 17(1):27-85, 2001. [doi]

Tangent Graeffe iterationGregorio Malajovich, Jorge P. Zubelli. nm, 89(4):749-782, 2001. [doi]

On the Geometry of Graeffe IterationGregorio Malajovich, Jorge P. Zubelli. jc, 17(3):541-573, 2001. [doi]

2000

Condition Number Bounds for Problems with Integer CoefficientsGregorio Malajovich. jc, 16(3):529-551, 2000. [doi]

1998

On the Structure of NP_CGregorio Malajovich, Klaus Meer. SICOMP, 28(1):27-35, 1998.

1994

On Generalized Newton Algorithms: Quadratic Convergence, Path-Following and Error AnalysisGregorio Malajovich. TCS, 133(1):65-84, 1994.

Sign in or sign up to see more results.

runs on WebDSL