The following pages link to (Q3735804):
Displaying 9 items.
- Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields (Q449717) (← links)
- Modular Las Vegas algorithms for polynomial absolute factorization (Q607052) (← links)
- On the number of irreducible factors of degree k dividing a given polynomial over GF(q) (Q915780) (← links)
- Fast Hensel's lifting implementation using partial fraction decomposition (Q1074651) (← links)
- Factorization over a finite field \(\mathbb F_{p^n}\) of the composite polynomials \(f\left(X^{p^r}-aX\right)\) where \(f(X)\) is an irreducible polynomial in \(\mathbb F_{p^n}(X)\) (Q1239188) (← links)
- A fast algorithm for polynomial factorization over \(\mathbb Q_p\) (Q1396437) (← links)
- Factorization in Z[x] (Q3454736) (← links)
- Approximate factorization of polynomials in Z[x] (Q5176470) (← links)
- Newton polygons of higher order in algebraic number theory (Q5388828) (← links)
