Advertisement

5 Factorization of polynomials

  • Franz Winkler
Part of the Texts and Monographs in Symbolic Computation book series (TEXTSMONOGR)

Abstract

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.

Keywords

Prime Number Arithmetic Operation Minimal Polynomial Irreducible Polynomial Irreducible Factor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Wien 1996

Authors and Affiliations

  • Franz Winkler
    • 1
  1. 1.Research Institute for Symbolic ComputationJohannes-Kepler-University LinzLinzAustria

Personalised recommendations