Solving polynomial systems over non-fields and applications to modular polynomial factoring

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Single-factor lifting and factorization of polynomials over local fields
Counting curves and their projections
Bounds for the degrees in the Nullstellensatz
Gröbner bases and primary decomposition of polynomial ideals
Algorithm of polynomial complexity for factoring polynomials over local fields
A lower bound for the number of solutions of equations over finite fields
Factoring modular polynomials
Decoding of Reed Solomon codes beyond the error-correction bound
Roots of polynomials modulo prime powers
Eine neue Theorie der algebraischen Zahlen.
Solvability of systems of polynomial congruences modulo a large prime
Newton polyhedra and Igusa's local zeta function
Counting solutions to equations in many variables over finite fields
Algebraic geometric codes over rings
On the complexity of solving quadratic Boolean systems
Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\)
Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields
Efficiently factoring polynomials modulo \(p^4\)
Resolution of singularities of an algebraic variety over a field of characteristic zero. II
Polynomial root finding over local rings and application to error correcting codes
Algorithms for modular counting of roots of multivariate polynomials
On Hensel factorization. I
Factoring polynomials over \(\mathbb Z_4\) and over certain Galois rings
Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields
Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
Computing all factorizations in ***
Fast Polynomial Factorization and Modular Composition
Sur les congruences aux racines données
The Structure of Polynomial Ideals and Gröbner Bases
List Decoding of Generalized Reed–Solomon Codes Over Commutative Rings
Improved List Decoding of Generalized Reed–Solomon and Alternant Codes Over Galois Rings
Point count divisibility for algebraic sets over ℤ/𝕡^{ℓ}ℤ and other finite principal rings
Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
A New Algorithm for Factoring Polynomials Over Finite Fields
A Remark on the Hensel Factorization Method
Unbalanced Oil and Vinegar Signature Schemes
The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
P-orderings and polynomial functions on arbitrary subsets of Dedekind rings.
The Nordstrom-Robinson code is algebraic-geometric
Beating Brute Force for Systems of Polynomial Equations over Finite Fields
An effective algorithm for deciding the solvability of a system of polynomial equations over 𝑝-adic integers
Fast Computation of the Roots of Polynomials Over the Ring of Power Series
Factorization of Polynomials over Z/(p ⁿ )
Special-case algorithms for blackbox radical membership, nullstellensatz and transcendence degree
Zeros of Polynomials over Finite Principal Ideal Rings
Randomized polynomial-time root counting in prime power rings
Programming Languages and Systems
Automata, Languages and Programming
Remarques sur les racines d'une congruence
On the problem of resolution of singularities in positive characteristic (Or: A proof we are still waiting for)
Computing Igusa’s local zeta function of univariates in deterministic polynomial-time
Factoring polynomials over finite fields: A survey
Root sets of polynomials modulo prime powers
An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function
Counting roots for polynomials modulo prime powers
A simple deterministic algorithm for systems of quadratic polynomials over \(\mathbb{F}_2\)

This page was built for publication: Solving polynomial systems over non-fields and applications to modular polynomial factoring