The following pages link to (Q4238960):
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)
- Factorisation patterns of division polynomials (Q1764332) (← links)
- Efficiently factoring polynomials modulo \(p^4\) (Q2229745) (← links)
- (Q3491689) (← links)
- (Q3754695) (← links)
- Factoring polynomials via polytopes (Q4657294) (← links)
- On the factors of a polynomial (Q5110608) (← links)
- Newton polygons of higher order in algebraic number theory (Q5388828) (← links)