Pages that link to "Item:Q2431382"
From MaRDI portal
The following pages link to A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis (Q2431382):
Displaying 17 items.
- Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian (Q423886) (← links)
- On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers (Q533873) (← links)
- A numerical algorithm for zero counting. III: Randomization and condition (Q651058) (← links)
- Computing the homology of real projective sets (Q667646) (← links)
- A numerical algorithm for zero counting. I: Complexity and accuracy (Q958246) (← links)
- On condition numbers and the distance to the nearest ill-posed problem (Q1079333) (← links)
- Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions (Q1727980) (← links)
- Grid methods in computational real algebraic (and semialgebraic) geometry (Q1754715) (← links)
- On the complexity of the Plantinga-Vegter algorithm (Q2172649) (← links)
- Computing the homology of semialgebraic sets. I: Lax formulas (Q2291730) (← links)
- On the expected number of zeros of nonlinear equations (Q2441420) (← links)
- On a condition number of general random polynomial systems (Q2792338) (← links)
- Smoothed analysis for the condition number of structured real polynomial systems (Q4999472) (← links)
- Functional norms, condition numbers and numerical algorithms in algebraic geometry (Q5056386) (← links)
- A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF (Q5177339) (← links)
- Newton iteration, conditioning and zero counting (Q5501607) (← links)
- On Łojasiewicz inequalities and the effective Putinar's Positivstellensatz (Q6639815) (← links)
