Symbolic factoring of polynomials in several variables
Dale E. Jordan, Lewis C. Clapp, Richard Y. Kain · Communications of the ACM · 1966
An algorithm for finding the symbolic factors of a multivariate polynomial with integer coefficients is presented. The algorithm is an extension of a technique used by Kronecker in a proof that the prime factoring of any polynomial may be found in a finite number of steps. The algorithm consists of factoring single-variable instances of the given polynomial by Kronecker's method and introducing the remaining variables by interpolation. Techniques for implementing the algorithm and several examples are discussed. The algorithm promises sufficient power to be used efficiently in an online system for symbolic mathematics.