Ashish Dwivedi

most citedCounting basic-irreducible factors mod

p^{k}

in deterministic poly-time and

p

-adic applications

2 citations · 2 across the 2 of their papers we have counts for

collaborators

3 papers

math.NT2020

Computing Igusa's local zeta function of univariates in deterministic polynomial-time

Ashish Dwivedi, Nitin Saxena

Igusa's local zeta function $Z_{f, p} (s)$ is the generating function that counts the number of integral roots, $N_{k} (f)$ , of $f (x) mod p^{k}$ , for all $k$ . It is a famous r…

cs.SC2019★ 2 cited

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

Ashish Dwivedi, Rajat Mittal, Nitin Saxena

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…

cs.CC2019

Efficiently factoring polynomials modulo $p^{4}$

Ashish Dwivedi, Rajat Mittal, Nitin Saxena

Polynomial factoring has famous practical algorithms over fields-- finite, rational \& $p$ -adic. However, modulo prime powers it gets hard as there is non-unique factorization and…

Computing Igusa's local zeta function of univariates in deterministic polynomial-time

Counting basic-irreducible factors mod pk in deterministic poly-time and p-adic applications

Efficiently factoring polynomials modulo p4

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

Efficiently factoring polynomials modulo $p^{4}$