Pages that link to "Item:Q2280315"
From MaRDI portal
The following pages link to Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals (Q2280315):
Displaying 7 items.
- Polynomial-division-based algorithms for computing linear recurrence relations (Q820938) (← links)
- Fast computation of generic bivariate resultants (Q1996880) (← links)
- (Q4227324) (← links)
- (Q4818838) (← links)
- Towards a Gröbner-free approach to coding (Q6146596) (← links)
- High-order lifting for polynomial Sylvester matrices (Q6149161) (← links)
- Bivariate polynomial reduction and elimination ideal over finite fields (Q6615408) (← links)