Factoring Polynomials over Local Fields II

  • Sebastian Pauli
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6197)

Abstract

We present an algorithm for factoring polynomials over local fields, in which the Montes algorithm is combined with elements from Zassenhaus Round Four algorithm. This algorithm avoids the computation of characteristic polynomials and the resulting precision problems that occur in the Round Four algorithm.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Sebastian Pauli
    • 1
  1. 1.Department of Mathematics and StatisticsUniversity of North Carolina at GreensboroGreensboroUSA

Personalised recommendations