Factorisation of Polynomials Modulo a 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.
Every page in the KEVOS library tagged Polynomial Algorithms. 5 pages.
Squarefree decomposition, distinct-degree factorisation by gcd with x^(q^d) − x, equal-degree splitting by Cantor-Zassenhaus, and Berlekamp's linear-algebra approach.
Hensel's lemma and quadratic lifting, Mignotte's coefficient bounds, the exponential recombination problem, and the LLL-based polynomial-time solution.
Dense and sparse polynomial representation, multiplication algorithms, pseudo-division over a UFD, primitive parts and content, and the subresultant and modular remedies for coe…
Numerical root finding for polynomials over C: conditioning, the Newton and Aberth methods, splitting-circle approaches, and the precision management needed to support exact num…
The subresultant polynomial remainder sequence, the resultant as a determinant and as a product over roots, the discriminant, and their use in elimination and in number field ar…