Pages that link to "Item:Q1422204"
From MaRDI portal
The following pages link to Fast algorithms for zero-dimensional polynomial systems using duality (Q1422204):
Displayed 10 items.
- Solving bivariate systems using rational univariate representations (Q325154) (← links)
- Overdetermined Weierstrass iteration and the nearest consistent system (Q476879) (← links)
- Separating linear forms and rational univariate representations of bivariate systems (Q480646) (← links)
- Multilinear polynomial systems: root isolation and bit complexity (Q1994888) (← links)
- Block-Krylov techniques in the context of sparse-FGLM algorithms (Q2284956) (← links)
- Computing and using minimal polynomials (Q2307625) (← links)
- Accelerated tower arithmetic (Q2338646) (← links)
- Fast computation of special resultants (Q2457312) (← links)
- Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin) (Q2481474) (← links)
- Elimination ideal and bivariate resultant over finite fields (Q6081978) (← links)