Thumbnail
Access Restriction
Subscribed

Author Clapp, Lewis C. ♦ Kain, Richard Y. ♦ Jordan, Dale E.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
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.
Description Affiliation: Computer Research Corp., Newton, MA (Jordan, Dale E.; Clapp, Lewis C.) || Massachusetts Institute of Technology, Cambridge, MA (Kain, Richard Y.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 9
Issue Number 8
Page Count 6
Starting Page 638
Ending Page 643


Open content in new tab

   Open content in new tab
Source: ACM Digital Library