Found 7 Documents (Results 1–7)
An effective description of the roots of bivariates \(\bmod p^k\) and the related Igusa’s local zeta function. (English) Zbl 07760756
Dickenstein, Alicia (ed.) et al., Proceedings of the 48th international symposium on symbolic and algebraic computation, ISSAC, Tromsø, Norway, July 24–27, 2023. New York, NY: Association for Computing Machinery (ACM). 135-144 (2023).
MSC:
68W30
Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields. (English) Zbl 1498.11241
Noisy polynomial interpolation modulo prime powers. (English) Zbl 1486.11161
Reviewer: Armen Bagdasaryan (Madīnat al-Kuwait)
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 (4)
- Collection Articles (3)
all
top 5
Author
- Saxena, Nitin (4)
- Dwivedi, Ashish (3)
- Chakrabarti, Sayak (2)
- Mittal, Rajat (2)
- Karpinski, Marek (1)
- Rojas, J. Maurice (1)
- Sharma, Divyum (1)
- Shparlinski, Igor E. (1)
- Singhal, L. C. (1)
- Zhu, Yuyu (1)
Serial
- J. Number Theory (1)
- J. Symb. Comput. (1)
- J. Complexity (1)
- Mosc. J. Comb. Number Theory (1)
