Finding an irreducible factor, of a polynomial f(x) modulo a prime p, is not known to be in deterministic polynomial time. Though there is such a classical algorithm that {\em counts} the number of irreducible factors of f\bmod p. We can ask the same question modulo prime-powers p^k. The irreducible ... more >>>