Pages that link to "Item:Q1994882"
From MaRDI portal
The following pages link to A fast parallel sparse polynomial GCD algorithm (Q1994882):
Displaying 7 items.
- Computing sparse GCD of multivariate polynomials via polynomial interpolation (Q1621170) (← links)
- An improved EZ-GCD algorithm for multivariate polynomials (Q2518611) (← links)
- Modular algorithm for sparse multivariate polynomial interpolation and its parallel implementation (Q2564819) (← links)
- Parallel polynomial operations on SMPs: An overview (Q2564820) (← links)
- Parallel algorithms on greatest common divisor of polynomial system (Q2886844) (← links)
- Irreducibility and greatest common divisor algorithms for sparse polynomials (Q3166375) (← links)
- (Q4875226) (← links)