Published in: LIPIcs, Volume 137, 34th Computational Complexity Conference (CCC 2019)
Ashish Dwivedi, Rajat Mittal, and Nitin Saxena. Counting Basic-Irreducible Factors Mod p^k in Deterministic Poly-Time and p-Adic Applications. In 34th Computational Complexity Conference (CCC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 137, pp. 15:1-15:29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{dwivedi_et_al:LIPIcs.CCC.2019.15, author = {Dwivedi, Ashish and Mittal, Rajat and Saxena, Nitin}, title = {{Counting Basic-Irreducible Factors Mod p^k in Deterministic Poly-Time and p-Adic Applications}}, booktitle = {34th Computational Complexity Conference (CCC 2019)}, pages = {15:1--15:29}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-116-0}, ISSN = {1868-8969}, year = {2019}, volume = {137}, editor = {Shpilka, Amir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.15}, URN = {urn:nbn:de:0030-drops-108373}, doi = {10.4230/LIPIcs.CCC.2019.15}, annote = {Keywords: deterministic, root, counting, modulo, prime-power, tree, basic irreducible, unramified} }
Feedback for Dagstuhl Publishing