✦ LIBER ✦

Generalized riemann hypothesis and factoring polynomials over finite fields

✍ Scribed by Ming-Deh A Huang

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 796 KB
Volume: 12
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(91)90014-p

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Factoring polynomials over finite fields

✍ Lajos Rónyai 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 529 KB

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

Factoring Dickson Polynomials over Finit

Factoring Dickson Polynomials over Finite Fields

✍ Manjul Bhargava; Michael E. Zieve 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 105 KB

Factoring multivariate polynomials over

Factoring multivariate polynomials over finite fields

✍ A.K. Lenstra 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 836 KB

Factoring Polynomials Over Finite Fields

Factoring Polynomials Over Finite Fields: A Survey

✍ Joachim von zur Gathen; Daniel Panario 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 452 KB

This survey reviews several algorithms for the factorization of univariate polynomials over finite fields. We emphasize the main ideas of the methods and provide an up-to-date bibliography of the problem.

On the deterministic complexity of facto

On the deterministic complexity of factoring polynomials over finite fields

✍ Victor Shoup 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 792 KB