Pages that link to "Item:Q1757020"
From MaRDI portal
The following pages link to On the complexity of the Lickteig-Roy subresultant algorithm (Q1757020):
Displayed 10 items.
- Computational schemes for subresultant chains (Q831961) (← links)
- Fast computation of generic bivariate resultants (Q1996880) (← links)
- Efficient sampling in spectrahedra and volume approximation (Q2144244) (← links)
- Subresultants of \((x-\alpha)^m\) and \((x-\beta)^n\), Jacobi polynomials and complexity (Q2188990) (← links)
- Directed evaluation (Q2192677) (← links)
- Fast multivariate multi-point evaluation revisited (Q2283121) (← links)
- Accelerated tower arithmetic (Q2338646) (← links)
- On the complexity exponent of polynomial system solving (Q2658549) (← links)
- Elimination ideal and bivariate resultant over finite fields (Q6081978) (← links)
- High-order lifting for polynomial Sylvester matrices (Q6149161) (← links)