Pages that link to "Item:Q958246"
From MaRDI portal
The following pages link to A numerical algorithm for zero counting. I: Complexity and accuracy (Q958246):
Displayed 7 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)
- On the probability distribution of data at points in real complete intersection varieties (Q945919) (← links)
- On a condition number of general random polynomial systems (Q2792338) (← links)
- A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF (Q5177339) (← links)
- Fast computation of zeros of polynomial systems with bounded degree under finite-precision (Q5401702) (← links)