The following pages link to Gregorio Malajovich (Q192026):
Displaying 34 items.
- High probability analysis of the condition number of sparse polynomial systems (Q598221) (← links)
- A numerical algorithm for zero counting. III: Randomization and condition (Q651058) (← links)
- A fast and stable algorithm for splitting polynomials (Q679271) (← links)
- A numerical algorithm for zero counting. I: Complexity and accuracy (Q958246) (← links)
- On generalized Newton algorithms: Quadratic convergence, path-following and error analysis (Q1338218) (← links)
- Condition number bounds for problems with integer coefficients (Q1594828) (← links)
- Lower bounds for some decision problems over \(C\) (Q1605321) (← links)
- Computing mixed volume and all mixed cells in quermassintegral time (Q1683740) (← links)
- Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric (Q1727976) (← links)
- A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis (Q2431382) (← links)
- On the expected number of zeros of nonlinear equations (Q2441420) (← links)
- On the number of minima of a random polynomial (Q2483199) (← links)
- On the curvature of the central path of linear programming theory (Q2505641) (← links)
- Computing minimal multi-homogeneous Bezout numbers is hard (Q2643147) (← links)
- On the expected number of real roots of polynomials and exponential sums (Q2693682) (← links)
- (Q3097387) (← links)
- Convexity Properties of the Condition Number (Q3584170) (← links)
- On the Structure of $\cal NP_\Bbb C$ (Q4210134) (← links)
- Newton's method on Riemannian manifolds: covariant alpha theory (Q4457844) (← links)
- (Q4789199) (← links)
- Convexity Properties of the Condition Number II (Q4902927) (← links)
- Adaptive step-size selection for homotopy methods to solve polynomial equations (Q4907959) (← links)
- (Q4925797) (← links)
- (Q5037634) (← links)
- A Theory of NP-completeness and Ill-conditioning for Approximate Real Computations (Q5215456) (← links)
- Newton iteration, conditioning and zero counting (Q5501607) (← links)
- STACS 2005 (Q5710679) (← links)
- On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture (Q5938580) (← links)
- On the complexity of computing error bounds (Q5944040) (← links)
- On the geometry of Graeffe iteration (Q5949383) (← links)
- Tangent Graeffe iteration (Q5952132) (← links)
- Complexity of sparse polynomial solving 2: renormalization (Q6171578) (← links)
- On the expected number of real roots of polynomials and exponential sums (Q6396368) (← links)
- Ultimate Polynomial Time (Q6501284) (← links)
