Polynomial reduction from multivariate to bivariate integral polynomial factorization
Erich Kaltofen · ACM SIGSAM Bulletin · 1982
Given an arbitrary but fixed integer r ≥ 3. We show that testing r-variate polynomials with integer coefficients for irreducibility is m-reducible in polynomial time of the total degree and the largest coefficient length to testing bi variate polynomials for irreducibility. Factoring r-variate polynomials into irreducibles is polynomial time Turing-reducible to completely factoring bi variate polynomials.