ACM SIGSAM Bulletin: Issue 28, December 1973
Citation Count: 11
Downloads (6 Weeks): 0, Downloads (12 Months): 5, Downloads (Overall): 192
Full text available:
This paper gives an algorithm for finding the irreducible factors of any multivariate polynomial with integer coefficients. The algorithm begins by making substitutions for all but one of the variable. This univariate polynomial is then factored by a known method, which uses an algorithm of Berlekamp for factoring univariate polynomials ...