Parallel Construction of Irreducible Polynomials

Let arithmetic pseudo-NCk denote the problems that can be solved by log space uniform arithmetic circuits over the nite prime eld Fp of depth O(logk(n + p)) and size (n + p)O(1). We show that the problem of constructing an irreducible polyno-