We present an efficient algorithm for factoring a multivariate polynomial f ∈ L[x1, . . . , xv] where L is an algebraic function field with k ≥ 0 parameters t1, . . . , tk an...
The purpose of this paper is to describe a method to determine whether a bivariate polynomial with rational coefficients is irreducible when regarded as an element in Q((x))[y], th...
Various results on parity of the number of irreducible factors of given polynomials over finite fields have been obtained in the recent literature. Those are mainly based on Swan&...
We describe the Maple [23] implementation of multivariate factorization over general finite fields. Our first implementation is available in Maple V Release 3. We give selected det...