"Counting basic-irreducible factors mod $p^k$ in deterministic poly-time ..."

Ashish Dwivedi, Rajat Mittal, Nitin Saxena (2019)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2020-08-26

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-1902-07785
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1902-07785
Ashish Dwivedi, Rajat Mittal, Nitin Saxena:
Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications. CoRR abs/1902.07785 (2019)

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.