Fast parallel absolute irreducibility testing

https://doi.org/10.1016/S0747-7171(85)80029-8Get rights and content
Under an Elsevier user license
open archive

We present a fast parallel deterministic algorithm for testing multivariate integral polynomials for absolute irreducibility, that is irreducibility over the complex numbers. More precisely, we establish that the set of absolutely irreducible integral polynomials belongs to the complexity class NC of Boolean circuits of polynomial size and logarithmic depth. Therefore it also belongs to the class of sequentially polynomial-time problems. Our algorithm can be extended to compute in parallel one irreducible complex factor of a multivariate integral polynomial. However, the coeffieients of the computed factor are only represented modulo a not necessarily irreducible polynomial specifying a splitting field. A consequence of our algorithm is that multivariate polynomials over finite fields can be tested for absolute irreducibility in deterministic sequential polynomial time in the size of the input. We also obtain a sharp bound for the last prime p for which, when taking an absolute irreducible integral polynomial modulo p, the polynomial's irreducibility in the algebraic closure of the finite field of order p is not preserved.

Cited by (0)

This research was partially supported by the National Science and Engineering Council of Canada under grant 3-643-126-90.

Author's current address: Rensselaer Polytechnic Institute, Department of Computer Science, Troy, New York, 12181, U.S.A.