Pages that link to "Item:Q2284969"

The following pages link to The complexity of sparse Hensel lifting and sparse polynomial factorization (Q2284969):

Displaying 9 items.

• Sparse multivariate Hensel lifting: a high-performance design and implementation (Q1662273) (← links)
• Factoring multivariate polynomials with many factors and huge coefficients (Q1798333) (← links)
• The complexity and parallel implementation of two sparse multivariate Hensel lifting algorithms for polynomial factorization (Q2110212) (← links)
• Newton-Hensel interpolation lifting (Q2433155) (← links)
• Factoring multivariate polynomials represented by black boxes: a Maple + C implementation (Q2680117) (← links)
• On factorization of multivariate polynomials over algebraic number and function fields (Q2883817) (← links)
• Sharp precision in Hensel lifting for bivariate polynomial factorization (Q3377003) (← links)
• A New Black Box Factorization Algorithm - the Non-monic Case (Q6060365) (← links)
• Complexity of sparse polynomial solving 2: renormalization (Q6171578) (← links)