Pages that link to "Item:Q5929709"
From MaRDI portal
The following pages link to Sylvester-Habicht sequences and fast Cauchy index computation (Q5929709):
Displayed 17 items.
- Automatic computation of the complete root classification for a parametric polynomial (Q840716) (← links)
- A parametric representation of totally mixed Nash equilibria (Q979929) (← links)
- On the asymptotic and practical complexity of solving bivariate systems over the reals (Q1025391) (← links)
- An elementary approach to subresultants theory. (Q1401153) (← links)
- Subresultants revisited. (Q1401299) (← links)
- On solving univariate sparse polynomials in logarithmic time (Q1763426) (← links)
- Systems of rational polynomial equations have polynomial size approximate zeros on the average (Q1869964) (← links)
- Towards faster real algebraic numbers (Q1878487) (← links)
- A fast version of the Schur-Cohn algorithm. (Q1977142) (← links)
- Real algebraic numbers and polynomial systems of small degree (Q2378492) (← links)
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study (Q2387419) (← links)
- Birational properties of the gap subresultant varieties (Q2456534) (← links)
- Fast computation of special resultants (Q2457312) (← links)
- Symmetric subresultants and applications (Q2470062) (← links)
- Exact, efficient, and complete arrangement computation for cubic curves (Q2507159) (← links)
- Block LU factorization of Hankel and Bezout matrices and Euclidean algorithm (Q3603591) (← links)
- D-resultant and subresultants (Q4671855) (← links)