𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Factoring polynomials modulo special primes

✍ Scribed by L. Rónyai

Publisher
Springer-Verlag
Year
1989
Tongue
English
Weight
408 KB
Volume
9
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Roots of Polynomials Modulo Prime Powers
Roots of Polynomials Modulo Prime Powers
✍ Bruce Dearden; Jerry Metzger 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 202 KB

In general , not every set of values modulo n will be the set of roots modulo n of some polynomial . In this note , some characteristics of those sets which are root sets modulo a prime power are developed , and these characteristics are used to determine the number of dif ferent sets of integers wh

Factoring Polynomials over Special Finit
Factoring Polynomials over Special Finite Fields
✍ Eric Bach; Joachim von zur Gathen; Hendrik W. Lenstra Jr. 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 227 KB

We exhibit a deterministic algorithm for factoring polynomials in one variable over "nite "elds. It is e$cient only if a positive integer k is known for which I (p) is built up from small prime factors; here I denotes the kth cyclotomic polynomial, and p is the characteristic of the "eld. In the cas

Root Sets of Polynomials Modulo Prime Po
Root Sets of Polynomials Modulo Prime Powers
✍ Davesh Maulik 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 194 KB

A subset R of the integers modulo n is defined to be a root set if it is the set of roots of some polynomial. Using the Chinese Remainder Theorem, the question of finding and counting root sets mod n is reduced to finding root sets modulo a prime power. In this paper, we provide a recursive construc

Linear Gaps between Degrees for the Poly
Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes
✍ Sam Buss; Dima Grigoriev; Russell Impagliazzo; Toniann Pitassi 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 214 KB

This paper gives nearly optimal lower bounds on the minimum degree of polynomial calculus refutations of Tseitin's graph tautologies and the mod p counting principles, p 2. The lower bounds apply to the polynomial calculus over fields or rings. These are the first linear lower bounds for the polynom