Pages that link to "Item:Q1822238"
From MaRDI portal
The following pages link to A new method for computing polynomial greatest common divisors and polynomial remainder sequences (Q1822238):
Displayed 4 items.
- Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation (Q1124757) (← links)
- Fast inversion of Hankel and Toeplitz matrices (Q1186587) (← links)
- On the complexity of the Lickteig-Roy subresultant algorithm (Q1757020) (← links)
- Matrix computation of subresultant polynomial remainder sequences in integral domains (Q1904349) (← links)