Pages that link to "Item:Q4068830"

The following pages link to Factoring Multivariate Polynomials Over the Integers (Q4068830):

Displaying 21 items.

• Sparse bivariate polynomial factorization (Q477285) (← links)
• Macsyma: A personal history (Q655565) (← links)
• A unified method for multivariate polynomial factorizations (Q689904) (← links)
• Interpolating polynomials from their values (Q915342) (← links)
• Computer algebra: Past and future (Q1098287) (← links)
• A p-adic approach to the computation of Gröbner bases (Q1118653) (← links)
• Approximate factorization of multivariate polynomials and absolute irreducibility testing (Q1179781) (← links)
• Massively parallel search for linear factors in polynomials with many variables (Q1366832) (← links)
• Massively parallel factorizations of polynomials with many non-commuting variables (Q1392026) (← links)
• Computing sparse GCD of multivariate polynomials via polynomial interpolation (Q1621170) (← links)
• Hensel construction with an arbitrary degree of convergence (Q1922224) (← links)
• The complexity of sparse Hensel lifting and sparse polynomial factorization (Q2284969) (← links)
• An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation (Q2482628) (← links)
• Factoring multivariate polynomials represented by black boxes: a Maple + C implementation (Q2680117) (← links)
• Using Sparse Interpolation in Hensel Lifting (Q2830017) (← links)
• Enhancing the Extended Hensel Construction by Using Gröbner Bases (Q2830021) (← links)
• Factorisation sur $\mathbb {Z}[X]$ des polynômes de degré élevé à l’aide d’un monomorphisme (Q3483364) (← links)
• (Q3859255) (← links)
• (Q3882549) (← links)
• Factorizations for \(n\)D polynomial matrices (Q5957407) (← links)
• A New Black Box Factorization Algorithm - the Non-monic Case (Q6060365) (← links)