The following pages link to (Q3971984):
Displaying 20 items.
- An efficient algorithm for factoring polynomials over algebraic extension field (Q365855) (← links)
- Sparse bivariate polynomial factorization (Q477285) (← links)
- A note on Gao's algorithm for polynomial factorization (Q633632) (← links)
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting (Q964741) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- A bibliography on roots of polynomials (Q1313191) (← links)
- A 2002 update of the supplementary bibliography on roots of polynomials (Q1612321) (← links)
- Bivariate factorization using a critical fiber (Q1683738) (← links)
- Equivalence of polynomial identity testing and polynomial factorization (Q2351391) (← links)
- Computing Frobenius maps and factoring polynomials (Q2366168) (← links)
- Lifting and recombination techniques for absolute factorization (Q2371310) (← links)
- Fast separable factorization and applications (Q2426955) (← links)
- Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time (Q2431341) (← links)
- Improved dense multivariate polynomial factorization algorithms (Q2457431) (← links)
- Commensurability of 1-cusped hyperbolic 3-manifolds (Q2782671) (← links)
- Irreducibility testing over local fields (Q4955868) (← links)
- Aurifeuillian factorization (Q5713243) (← links)
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring (Q5889792) (← links)
- Factoring polynomials over finite fields: A survey (Q5928877) (← links)
- Kronecker's and Newton's approaches to solving: a first comparison (Q5938585) (← links)
