Found 3 Documents (Results 1–3)
Counting basic-irreducible factors mod\(p^k\) in deterministic poly-time and \(p\)-adic applications. (English) Zbl 07564415
Shpilka, Amir (ed.), 34th computational complexity conference, CCC 2019, New Brunswick, NJ, USA, July 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 137, Article 15, 29 p. (2019).
MSC:
68Q25
Efficiently factoring polynomials modulo \(p^4\). (English) Zbl 1467.11113
Bradford, Russell (ed.), Proceedings of the 44th international symposium on symbolic and algebraic computation, ISSAC ’19, Beijing, China, July 15–18, 2019. New York, NY: Association for Computing Machinery (ACM). 139-146 (2019).
Filter Results by …
Document Type
- Journal Articles (1)
- Collection Articles (2)
Author
- Dwivedi, Ashish (3)
- Saxena, Nitin (3)
- Mittal, Rajat (2)
- Chakrabarti, Sayak (1)
