Pages that link to "Item:Q1798333"

The following pages link to Factoring multivariate polynomials with many factors and huge coefficients (Q1798333):

Displaying 10 items.

• A tree distinguishing polynomial (Q106322) (← links)
• Computational schemes for subresultant chains (Q831961) (← links)
• Extracting sparse factors from multivariate integral polynomials (Q1940925) (← links)
• The complexity of sparse Hensel lifting and sparse polynomial factorization (Q2284969) (← links)
• Parallelization of triangular decompositions: techniques and implementation (Q2674015) (← links)
• Factoring multivariate polynomials represented by black boxes: a Maple + C implementation (Q2680117) (← links)
• (Q4723297) (← links)
• Factoring a binary polynomial of degree over one million (Q4810180) (← links)
• A New Black Box Factorization Algorithm - the Non-monic Case (Q6060365) (← links)
• Detecting and parametrizing polynomial surfaces without base points (Q6143342) (← links)