Optimal algorithm for algebraic factoring (Q676848)

One of the most useful algebraic algorithms is explained, namely the factorization of polynomials in several variables (generally exceeding the degree of transcendence). Beginning with a square-free assumption, the number of variables is lowered in stages by ``lucky'' modular substitution of integers to restrict the possible factorizations and then lifted in stages to confirm the factorizations in the original variables by the Hensel process. Complete algorithms are given, with useful illustrations. References include \textit{A. K. Lenstra} [SIAM J. Comput. 16, 591-598 (1987; Zbl 0636.12005)].