A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On square-free factorization of multivariate polynomials over a finite field
1997
Theoretical Computer Science
In this paper we present a new deterministic algorithm for computing the square-free decomposition of multivariate polynomials with coefficients from a finite field. Our algorithm is based on Yun's square-free factorization algorithm for characteristic 0. The new algorithm is more efficient than existing, deterministic algorithms based on Musser's squarefree algorithm. We will show that the modular approach presented by Yun has no significant performance advantage over our algorithm. The new
doi:10.1016/s0304-3975(97)00059-5
fatcat:3zucsxzip5dchdpeayu5sijx2m