Pages that link to "Item:Q651058"
From MaRDI portal
The following pages link to A numerical algorithm for zero counting. III: Randomization and condition (Q651058):
Displaying 16 items.
- Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian (Q423886) (← links)
- Computing the homology of real projective sets (Q667646) (← links)
- A numerical algorithm for zero counting. I: Complexity and accuracy (Q958246) (← 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)
- Approximate zeros and condition numbers (Q1974565) (← links)
- On the complexity of the Plantinga-Vegter algorithm (Q2172649) (← links)
- Computing the homology of semialgebraic sets. I: Lax formulas (Q2291730) (← links)
- Rice formula for processes with jumps and applications (Q2340036) (← links)
- On the condition of the zeros of characteristic polynomials (Q2402421) (← 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 a condition number of general random polynomial systems (Q2792338) (← links)
- Real roots of random polynomials: expectation and repulsion (Q3466890) (← 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)
