Counting Basic-Irreducible Factors Mod p^k in Deterministic Poly-Time and p-Adic Applications - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Ashish Dwivedi, Rajat Mittal, Nitin Saxena 0001. Counting Basic-Irreducible Factors Mod p^k in Deterministic Poly-Time and p-Adic Applications. In Amir Shpilka, editor, 34th Computational Complexity Conference, CCC 2019, July 18-20, 2019, New Brunswick, NJ, USA. Volume 137 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. [doi]

This author has not been identified. Look up 'Ashish Dwivedi' in GoogleThis author has not been identified. Look up 'Rajat Mittal' in GoogleThis author has not been identified. Look up 'Nitin Saxena 0001' in Google

runs on WebDSL