1996 | OriginalPaper | Chapter
5 Factorization of polynomials
Author : Dipl.-Ing. Dr. Franz Winkler
Published in: Polynomial Algorithms in Computer Algebra
Publisher: Springer Vienna
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Similar to what we have done for the computation of gcds of polynomials, we will reduce the computation of the factors of an integral polynomial to the computation of the factors of the polynomial modulo a prime number. So we have to investigate this problem first, i.e., we consider the problem of factoring a polynomial a(x) ∈ ℤp[x], p a prime number. W.l.o.g. we may assume that lc(a) = 1.