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)].
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Factoring Polynomials Over Algebraic Number Fields
- scientific article; zbMATH DE number 3860385 (Why is no real title available?)
- scientific article; zbMATH DE number 3968702 (Why is no real title available?)
- scientific article; zbMATH DE number 3785004 (Why is no real title available?)
- Integration: solving the Risch differential equation
This page was built for publication: Optimal algorithm for algebraic factoring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676848)
