Fast parallel absolute irreducibility testing.pdfVIP

Fast Parallel Absolute Irreducibility Testing * U Erich Kaltofen niversity of Toronto e T Department of Computer Scienc oronto, Ontario M5S1A4, Canada W Abstract e present a fast parallel deterministic algorithm for testing multivariate integral polyno- - c mials for absolute irreducibility, that is irreducibility over the complex numbers. More pre isely, we establish that the set of absolutely irreducible integral polynomials belongs to the e i complexity class NC of Boolean circuits of polynomial size and logarithmic depth. Therefor t also belongs to the class of sequentially polynomial-time