Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > BASIC IRREDUCIBLE:
Reports tagged with basic irreducible:
TR19-033 | 20th February 2019
Ashish Dwivedi, Rajat Mittal, Nitin Saxena

#### Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications

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 >>>

ISSN 1433-8092 | Imprint