Efficiently factoring polynomials modulo \(p^4\)
From MaRDI portal
Publication:2229745
DOI10.1016/j.jsc.2020.10.001zbMath1465.13022OpenAlexW3094171211MaRDI QIDQ2229745
Ashish Dwivedi, Nitin Saxena, Rajat Mittal
Publication date: 18 February 2021
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2020.10.001
Related Items (2)
An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function ⋮ Noisy polynomial interpolation modulo prime powers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Single-factor lifting and factorization of polynomials over local fields
- Factoring polynomials with rational coefficients
- Algorithm of polynomial complexity for factoring polynomials over local fields
- Factoring modular polynomials
- Newton polyhedra and Igusa's local zeta function
- Polynomial root finding over local rings and application to error correcting codes
- On Hensel factorization. I
- Factoring polynomials over \(\mathbb Z_4\) and over certain Galois rings
- On the computation of all extensions of a 𝑝-adic field of a given degree
- Computing all factorizations in ***
- Fast Polynomial Factorization and Modular Composition
- Factoring Polynomials over Algebraic Number Fields
- A New Algorithm for Factoring Polynomials Over Finite Fields
- Fast Computation of the Roots of Polynomials Over the Ring of Power Series
- Factorization of Polynomials over Z/(p n )
- Efficiently Factoring Polynomials Modulo p4
- On the generation of multivariate polynomials which are hard to factor
- Computing Igusa’s local zeta function of univariates in deterministic polynomial-time
- Factoring polynomials over finite fields: A survey
This page was built for publication: Efficiently factoring polynomials modulo \(p^4\)
