| Publication | Date of Publication | Type |
|---|
Complexity of sparse polynomial solving 2: renormalization
IMA Journal of Numerical Analysis | 2023-08-14 | Paper |
On the expected number of real roots of polynomials and exponential sums
Journal of Complexity | 2023-03-24 | Paper |
On the expected number of real roots of polynomials and exponential sums
(available as arXiv preprint) | 2022-04-12 | Paper |
| scientific article; zbMATH DE number 7483785 (Why is no real title available?) | 2022-03-03 | Paper |
A Theory of NP-completeness and Ill-conditioning for Approximate Real Computations
Journal of the ACM | 2020-02-11 | Paper |
Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric
Foundations of Computational Mathematics | 2019-02-21 | Paper |
Computing mixed volume and all mixed cells in quermassintegral time
Foundations of Computational Mathematics | 2017-12-01 | Paper |
Newton iteration, conditioning and zero counting
Recent Advances in Real Complexity and Computation | 2015-08-04 | Paper |
| Average mixed volume under projection | 2014-10-21 | Paper |
On the expected number of zeros of nonlinear equations
Foundations of Computational Mathematics | 2014-03-24 | Paper |
| scientific article; zbMATH DE number 6174859 (Why is no real title available?) | 2013-06-12 | Paper |
Adaptive step-size selection for homotopy methods to solve polynomial equations
IMA Journal of Numerical Analysis | 2013-02-27 | Paper |
Convexity Properties of the Condition Number II
SIAM Journal on Matrix Analysis and Applications | 2013-01-18 | Paper |
Convexity Properties of the Condition Number II
SIAM Journal on Matrix Analysis and Applications | 2013-01-18 | Paper |
A numerical algorithm for zero counting. III: Randomization and condition
Advances in Applied Mathematics | 2011-12-08 | Paper |
A numerical algorithm for zero counting. III: Randomization and condition
Advances in Applied Mathematics | 2011-12-08 | Paper |
| Nonlinear equations. Paper from the 28th Brazilian mathematics colloquium -- 28\(^{\text o}\) Colóquio Brasileiro de Matemática, Rio de Janeiro, Brazil, July 2011 | 2011-11-16 | Paper |
A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis
Journal of Fixed Point Theory and Applications | 2011-04-13 | Paper |
Convexity properties of the condition number
SIAM Journal on Matrix Analysis and Applications | 2010-08-19 | Paper |
Convexity properties of the condition number
SIAM Journal on Matrix Analysis and Applications | 2010-08-19 | Paper |
| A numerical algorithm for zero counting II: Randomization and Condition | 2008-12-17 | Paper |
A numerical algorithm for zero counting. I: Complexity and accuracy
Journal of Complexity | 2008-12-03 | Paper |
On the number of minima of a random polynomial
Journal of Complexity | 2008-04-28 | Paper |
Computing minimal multi-homogeneous Bezout numbers is hard
Theory of Computing Systems | 2007-08-23 | Paper |
On the curvature of the central path of linear programming theory
Foundations of Computational Mathematics | 2006-09-28 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
High probability analysis of the condition number of sparse polynomial systems
Theoretical Computer Science | 2004-08-06 | Paper |
Newton's method on Riemannian manifolds: covariant alpha theory
IMA Journal of Numerical Analysis | 2004-03-17 | Paper |
| scientific article; zbMATH DE number 1859216 (Why is no real title available?) | 2003-04-23 | Paper |
On the complexity of computing error bounds
Foundations of Computational Mathematics | 2002-11-05 | Paper |
Tangent Graeffe iteration
Numerische Mathematik | 2002-09-29 | Paper |
On the geometry of Graeffe iteration
Journal of Complexity | 2002-09-29 | Paper |
Lower bounds for some decision problems over \(C\)
Theoretical Computer Science | 2002-07-15 | Paper |
On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture
Journal of Complexity | 2001-12-12 | Paper |
Condition number bounds for problems with integer coefficients
Journal of Complexity | 2001-07-05 | Paper |
| Random Sparse Polynomial Systems | 2000-12-13 | Paper |
A fast and stable algorithm for splitting polynomials
Computers & Mathematics with Applications | 1999-06-03 | Paper |
On the Structure of $\cal NP_\Bbb C$
SIAM Journal on Computing | 1998-09-21 | Paper |
On generalized Newton algorithms: Quadratic convergence, path-following and error analysis
Theoretical Computer Science | 1995-05-07 | Paper |
Ultimate Polynomial Time
(available as arXiv preprint) | N/A | Paper |
