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

DOI10.4230/LIPIcs.CCC.2019.15arXiv1902.07785MaRDI QIDQ6314372

Rajat Mittal, Nitin Saxena, Ashish Dwivedi

Publication date: 20 February 2019

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications