Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications (Q6314372)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications |
scientific article; zbMATH DE number 7564415
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications |
scientific article; zbMATH DE number 7564415 |
Statements
20 February 2019
0 references
cs.SC
0 references
cs.CC
0 references
cs.DS
0 references
math.NT
0 references
