From: emanuelsen@courier6.aero.org (William A. Emanuelsen)
Newsgroups: sci.math.symbolic
Subject: Re: factoring polynomials: references?
Date: Mon, 09 Oct 1995 10:13:26 -0800

In article <44kndo$miv@morgoth.sfu.ca>, rcorless@cecm.sfu.ca@sfu.ca wrote:

> >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.

An interesting web site: http://symbolicnet.mcs.kent.edu/

I found a nice tutorial paper on Groebner bases there, and they have a
list of other references as well. It's worth a look.
-- 
William A. Emanuelsen           Help! I'm being held prisoner
emanuelsen@courier6.aero.org      in a .signature factory!