This paper describes algorithms for factoring a polynomial in one or more variables, with integer coefficients, into factors which are irreducible over the integers These algorithms are based on the use of factorIzatmns over finite fields and “Hensel's lemma constructions” “Abstract algorithm” descripttons are used m the presentation of the underlying algebra:c theory Included s a new generahzatmn of Hensel's p-adlc constructmn which leads to a practical algorithm for factorlng multivariate polynommls The univarmte case algorithm is also specified m greater deta:l than in the prewous literature, with attentmn to a number of improvements wh:ch the author has developed based OR theoretical computing time analyses and experience with actual implementatmns. © 1975, ACM. All rights reserved.
CITATION STYLE
Musser, D. R. (1975). Multivariate Polynomial Factorization. Journal of the ACM (JACM), 22(2), 291–308. https://doi.org/10.1145/321879.321890
Mendeley helps you to discover research relevant for your work.