On Bivariate Polynomial Factorization over Finite Fields

Igor E. Shparlinski
1993 Mathematics of Computation  
This paper shows that a recently proposed approach of D. Q. Wan to bivariate factorization over finite fields, the univariate factoring algorithm of V. Shoup, and the new bound of this paper for the average number of irreducible divisors of polynomials of a given degree over a finite field can be used to design a bivariate factoring algorithm that is polynomial for "almost all" bivariate polynomials.
doi:10.2307/2153117 fatcat:bqvozgayknfbzpb5fnkcx6q7za