"Counting Basic-Irreducible Factors Mod p^k in Deterministic Poly-Time and ..."

Ashish Dwivedi, Rajat Mittal, Nitin Saxena (2019)

> Home

Details and statistics

DOI: 10.4230/LIPICS.CCC.2019.15

access: open

type: Conference or Workshop Paper

metadata version: 2023-02-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/coco/DwivediM019
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/DwivediM019
Ashish Dwivedi, Rajat Mittal, Nitin Saxena:
Counting Basic-Irreducible Factors Mod p^k in Deterministic Poly-Time and p-Adic Applications. CCC 2019: 15:1-15:29

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.