Pages that link to "Item:Q1338222"
From MaRDI portal
The following pages link to Complexity of Bezout's theorem. V: Polynomial time (Q1338222):
Displaying 19 items.
- On the probability distribution of singular varieties of given corank (Q2457405) (← links)
- The average condition number of most tensor rank decomposition problems is infinite (Q2697393) (← links)
- Catagenesis condition for approximate theorem-proving (Q2764247) (← links)
- On a condition number of general random polynomial systems (Q2792338) (← links)
- Smale’s 17th problem: Average polynomial time to compute affine and projective solutions (Q3079201) (← links)
- Smale 17th Problem: Advances and Open Directions (Q3380357) (← links)
- On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined case (Q3433761) (← links)
- The probability that a slightly perturbed numerical analysis problem is difficult (Q3577011) (← links)
- On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables (Q4517525) (← links)
- Geometry of polynomials and root-finding via path-lifting (Q4606640) (← links)
- Multihomogeneous Newton methods (Q4955862) (← links)
- Newton's method for overdetermined systems of equations (Q4955863) (← links)
- Plantinga-Vegter Algorithm takes Average Polynomial Time (Q5120482) (← links)
- A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF (Q5177339) (← links)
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems (Q5220197) (← links)
- Fast computation of zeros of polynomial systems with bounded degree under finite-precision (Q5401702) (← links)
- Kronecker's and Newton's approaches to solving: a first comparison (Q5938585) (← links)
- On the geometry of Graeffe iteration (Q5949383) (← links)
- Rigid continuation paths II. structured polynomial systems (Q6103341) (← links)
