TY - JOUR
T1 - On bivariate polynomial factorization over finite fields
AU - Shparlinski, Igor E.
PY - 1993
Y1 - 1993
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84968492801&partnerID=8YFLogxK
U2 - 10.1090/S0025-5718-1993-1176716-3
DO - 10.1090/S0025-5718-1993-1176716-3
M3 - Article
VL - 60
SP - 787
EP - 791
JO - Mathematics of Computation
JF - Mathematics of Computation
SN - 0025-5718
IS - 202
ER -