Factoring Polynomials over Local Fields II
نویسنده
چکیده
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.
منابع مشابه
A New Algorithm for Factoring Polynomials Over Finite Fields
We present a new probabilistic algorithm for factoring polynomials over finite fields.
متن کاملFactoring polynomials over Z4 and over certain Galois rings
It is known that univariate polynomials over finite local rings factor uniquely into primary pairwise coprime factors. Primary polynomials are not necessarily irreducible. Here we describe a factorisation into irreducible factors for primary polynomials over Z4 and more generally over Galois rings of characteristic p. An algorithm is also given. As an application, we factor x − 1 and x + 1 over...
متن کاملFactoring Polynomials over Finite Fields: Asymptotic Complexity vs. Reality
Several algorithms for factoring polynomials over nite elds are compared from the point of view of asymptotic complexity, and from a more realistic point of view: how well actual implementations perform on \moderately" sized inputs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005