On algorithms to find \(p\)-ordering

DOI10.1007/978-3-030-67899-9_27OpenAlexW3127738177MaRDI QIDQ831740

Aditya Gulati, Rajat Mittal, Sayak Chakrabarti

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-67899-9_27

zbMATH Keywords

polynomialsp-orderingprime powersroot-sets

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

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
• \(P\)-orderings of finite subsets of Dedekind domains
• Factoring polynomials with rational coefficients
• Decoding of Reed Solomon codes beyond the error-correction bound
• Roots of polynomials modulo prime powers
• PRIMES is in P
• On the Chor-Rivest knapsack cryptosystem
• Polynomial root finding over local rings and application to error correcting codes
• On Hensel factorization. I
• The Factorial Function and Generalizations
• On 𝑃-orderings, rings of integer-valued polynomials, and ultrametric analysis
• Polynomial Codes Over Certain Finite Fields
• On a class of error correcting binary group codes
• A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft)
• A New Algorithm for Factoring Polynomials Over Finite Fields
• P-orderings and polynomial functions on arbitrary subsets of Dedekind rings.
• Efficiently Factoring Polynomials Modulo p4
• Factoring Polynomials Over Large Finite Fields
• Root sets of polynomials modulo prime powers
• Counting roots for polynomials modulo prime powers

This page was built for publication: On algorithms to find \(p\)-ordering