Polynomial factorization over F2
نویسندگان
چکیده
We describe algorithms for polynomial factorization over the binary field F2, and their implementation. They allow polynomials of degree up to 250 000 to be factored in about one day of CPU time, distributing the work on two processors.
منابع مشابه
Factoring high-degree polynomials over F2 with Niederreiter's algorithm on the IBM SP2
A C implementation of Niederreiter’s algorithm for factoring polynomials over F2 is described. The most time-consuming part of this algorithm, which consists of setting up and solving a certain system of linear equations, is performed in parallel. Once a basis for the solution space is found, all irreducible factors of the polynomial can be extracted by suitable gcdcomputations. For this purpos...
متن کاملA BSP Parallel Model for the Göttfert Algorithm over F2
In Niederreiter’s factorization algorithm for univariate polynomials over finite fields, the factorization problem is reduced to solving a linear system over the finite field in question, and the solutions are used to produce the complete factorization of the polynomial into irreducibles. For fields of characteristic 2, a polynomial time algorithm for extracting the factors using the solutions ...
متن کاملRecovering Exact Results from Inexact Numerical Data in Algebraic Geometry
Let {f1, f2, . . . , ft} ⊂ Q[z1, . . . , zN ] be a set of homogeneous polynomials. Let Z denote the complex, projective, algebraic set determined by the homogeneous ideal I = (f1, f2, . . . , ft) ⊂ C[z1, . . . , zN ]. Numerical continuation-based methods can be used to produce arbitrary precision numerical approximations of generic points on each irreducible component of Z. Consider the prime d...
متن کاملNew Bases for Polynomial-Based Spaces
Since it is well-known that the Vandermonde matrix is ill-conditioned, while the interpolation itself is not unstable in function space, this paper surveys the choices of other new bases. These bases are data-dependent and are categorized into discretely l2-orthonormal and continuously L2-orthonormal bases. The first one construct a unitary Gramian matrix in the space l2(X) while the late...
متن کاملDeterministic distinct-degree factorization of polynomials over finite fields
A deterministic polynomial time algorithm is presented for finding the distinctdegree factorization of multivariate polynomials over finite fields. As a consequence, one can count the number of irreducible factors of polynomials over finite fields in deterministic polynomial time, thus resolving a theoretical open problem of Kaltofen from 1987.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 71 شماره
صفحات -
تاریخ انتشار 2002