Go to the corresponding LIPIcs Volume Portal 
Dwivedi, Ashish ; Mittal, Rajat ; Saxena, Nitin
pdfformat: 

@InProceedings{dwivedi_et_al:LIPIcs:2019:10837, author = {Ashish Dwivedi and Rajat Mittal and Nitin Saxena}, title = {{Counting BasicIrreducible Factors Mod p^k in Deterministic PolyTime and pAdic Applications}}, booktitle = {34th Computational Complexity Conference (CCC 2019)}, pages = {15:115:29}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771160}, ISSN = {18688969}, year = {2019}, volume = {137}, editor = {Amir Shpilka}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10837}, URN = {urn:nbn:de:0030drops108373}, doi = {10.4230/LIPIcs.CCC.2019.15}, annote = {Keywords: deterministic, root, counting, modulo, primepower, tree, basic irreducible, unramified} }
Keywords:  deterministic, root, counting, modulo, primepower, tree, basic irreducible, unramified  
Seminar:  34th Computational Complexity Conference (CCC 2019)  
Issue Date:  2019  
Date of publication:  16.07.2019 