From: rcorless@cecm.sfu.ca@sfu.ca
Newsgroups: sci.math.symbolic
Subject: Re: factoring polynomials: references?
Date: 1 Oct 1995 00:29:44 GMT

In <44eig4$vf5@cymbal.aix.calpoly.edu>, kmorriso@cymbal.aix.calpoly.edu (Kent E Morrison) writes:
>I am interested in references to the literature that describes
>the algorithms used by Maple (or Mathematica) in factoring
>polynomials over the integers. Particularly I would like to
>know whether reduction mod p is used and how.

You will find the information you seek in the book
Keith Geddes, Stephen Czapor, and George Labahn
``Algorithms for Computer Algebra'', Kluwer, 1992,
Chapter 8.