Pages that link to "Item:Q2110212"
From MaRDI portal
The following pages link to The complexity and parallel implementation of two sparse multivariate Hensel lifting algorithms for polynomial factorization (Q2110212):
Displaying 5 items.
- Sparse multivariate Hensel lifting: a high-performance design and implementation (Q1662273) (← links)
- The complexity of sparse Hensel lifting and sparse polynomial factorization (Q2284969) (← links)
- Factoring multivariate polynomials represented by black boxes: a Maple + C implementation (Q2680117) (← links)
- Sharp precision in Hensel lifting for bivariate polynomial factorization (Q3377003) (← links)
- A New Black Box Factorization Algorithm - the Non-monic Case (Q6060365) (← links)