Pages that link to "Item:Q5262753"

The following pages link to Algorithms for the non-monic case of the sparse modular GCD algorithm (Q5262753):

Displaying 9 items.

• Sparse interpolation of multivariate rational functions (Q633622) (← links)
• Computing sparse GCD of multivariate polynomials via polynomial interpolation (Q1621170) (← links)
• A new algorithm for computing the extended Hensel construction of multivariate polynomials (Q1757719) (← links)
• A fast parallel sparse polynomial GCD algorithm (Q1994882) (← links)
• Sparse polynomial interpolation based on diversification (Q2143469) (← links)
• Parallelization of triangular decompositions: techniques and implementation (Q2674015) (← links)
• Enhancing the Extended Hensel Construction by Using Gröbner Bases (Q2830021) (← links)
• Some results on counting roots of polynomials and the Sylvester resultant (Q5111015) (← links)
• Balancing act: multivariate rational reconstruction for IBP (Q6173579) (← links)