Symbolic factoring of polynomials in several variables

Authors:
Dale E. Jordan;Lewis C. Clapp;Richard Y. Kain
Affiliations:
Computer Research Corp., Newton, MA;Computer Research Corp., Newton, MA;Massachusetts Institute of Technology, Cambridge, MA
Venue:
Communications of the ACM
Year:
1966

Citing 0
Cited 4

Computer Algebra: Past and Future

Journal of Symbolic Computation
Survey of formula manipulation

Communications of the ACM
Linear circuit analysis by symbolic algebra

ACM '69 Proceedings of the 1969 24th national conference
The SAC-1 system: An introduction and survey

SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation

Quantified Score

Hi-index	48.23

Visualization

Abstract

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.