The following pages link to Factoring modular polynomials (Q1273766):
Displaying 9 items.
- On the number of irreducible factors of degree k dividing a given polynomial over GF(q) (Q915780) (← links)
- Noisy polynomial interpolation modulo prime powers (Q2034569) (← links)
- Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields (Q2167518) (← links)
- Efficiently factoring polynomials modulo \(p^4\) (Q2229745) (← links)
- Factoring polynomials over \(\mathbb Z_4\) and over certain Galois rings (Q2567153) (← links)
- (Q5091766) (← links)
- Randomized polynomial-time root counting in prime power rings (Q5235106) (← links)
- Counting roots for polynomials modulo prime powers (Q6165864) (← links)
- Solving polynomial systems over non-fields and applications to modular polynomial factoring (Q6543078) (← links)
