Engineering↗
Distinct Degree Factorisation
Separating irreducible factors by degree using GCDs against Frobenius powers, and the early-abort strategies that make it fast.
Every page in the KEVOS library tagged Polynomial Factorisation. 5 pages.
Separating irreducible factors by degree using GCDs against Frobenius powers, and the early-abort strategies that make it fast.
Factoring polynomials whose coefficients lie in a number field, by reduction to the rational case via norms.
The three-stage pipeline used to factor polynomials over finite fields and the integers, and why the stages are ordered as they are.
Decomposing a prime that does not divide the index, by factoring the defining polynomial modulo that prime.
Squarefree decomposition, distinct-degree factorisation by gcd with x^(q^d) − x, equal-degree splitting by Cantor-Zassenhaus, and Berlekamp's linear-algebra approach.