On the factorization of multivariate polynomials over finite fields
Steven L Swanson · Purdue e-Pubs (Purdue University System) · 1993
We describe the factorization of bivariate polynomials over finite fields. This includes a new algorithm to compute square-free decompositions, as well as the algorithm to factor square-free polynomials. Emphasis is put on practical calculation. We explain how certain information about the polynomials can make the calculations more efficient. We make several remarks on the computer implementation. We illustrate our methods in many example calculations.