scientific article; zbMATH DE number 7564415
From MaRDI portal
Publication:5091766
DOI10.4230/LIPICS.CCC.2019.15MaRDI QIDQ5091766
Ashish Dwivedi, Rajat Mittal, Nitin Saxena
Publication date: 27 July 2022
Full work available at URL: https://arxiv.org/abs/1902.07785
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields ⋮ An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithm of polynomial complexity for factoring polynomials over local fields
- Factoring modular polynomials
- Roots of polynomials modulo prime powers
- Newton polyhedra and Igusa's local zeta function
- Counting solutions to equations in many variables over finite fields
- 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
- Sur les congruences aux racines données
- A New Algorithm for Factoring Polynomials Over Finite Fields
- P-orderings and polynomial functions on arbitrary subsets of Dedekind rings.
- Complex powers and asymptotic expansions. I. Functions of certain types.
- 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
- Randomized polynomial-time root counting in prime power rings
- On the generation of multivariate polynomials which are hard to factor
- Remarques sur les racines d'une congruence
- Factoring polynomials over finite fields: A survey
- Root sets of polynomials modulo prime powers
This page was built for publication:
