Pages that link to "Item:Q4168687"

The following pages link to An Improved Multivariate Polynomial Factoring Algorithm (Q4168687):

Displaying 22 items.

• An efficient algorithm for factoring polynomials over algebraic extension field (Q365855) (← links)
• Sparse bivariate polynomial factorization (Q477285) (← links)
• Symbolic iterative algorithm for generalized inversion of rational polynomial matrices (Q580902) (← links)
• Interpolating polynomials from their values (Q915342) (← links)
• MACSYMA from F to G (Q1062750) (← links)
• Computer algebra: Past and future (Q1098287) (← links)
• A p-adic approach to the computation of Gröbner bases (Q1118653) (← links)
• Factoring multivariate integral polynomials (Q1348530) (← links)
• Computation of simple and group factors of multivariate polynomials (Q1366476) (← 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)
• A fast parallel sparse polynomial GCD algorithm (Q1994882) (← 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)
• An improved EZ-GCD algorithm for multivariate polynomials (Q2518611) (← links)
• Parallelization of triangular decompositions: techniques and implementation (Q2674015) (← links)
• Using Sparse Interpolation in Hensel Lifting (Q2830017) (← links)
• Enhancing the Extended Hensel Construction by Using Gröbner Bases (Q2830021) (← links)
• (Q3882549) (← links)
• Factoring multivariate polynomials via partial differential equations (Q4794644) (← links)
• Using sparse interpolation to solve multivariate diophantine equations (Q5270178) (← links)
• Detecting and parametrizing polynomial surfaces without base points (Q6143342) (← links)