✦ LIBER ✦

On the factorization of polynomials

✍ Scribed by H. Kempfert

Publisher: Elsevier Science
Year: 1969
Tongue: English
Weight: 228 KB
Volume: 1
Category: Article
ISSN: 0022-314X
DOI: 10.1016/0022-314x(69)90030-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the factorization of Eulerian polynom

On the factorization of Eulerian polynomials

✍ Arnošt J.J Heidrich 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 503 KB

A theorem on the factorization of matrix

A theorem on the factorization of matrix polynomials

✍ J. Maroulas 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 363 KB

On the Deterministic Complexity of Facto

On the Deterministic Complexity of Factoring Polynomials

✍ Shuhong Gao 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 345 KB

The paper focuses on the deterministic complexity of factoring polynomials over finite fields assuming the extended Riemann hypothesis (ERH). By the works of and , the general problem reduces deterministically in polynomial time to finding a proper factor of any squarefree and completely splitting

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

Factorization of polynomials using commu

Factorization of polynomials using commuting matrices

✍ Thomas J. Laffey; Eleanor Meehan 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 748 KB

The Factorization of Dickson Polynomials

The Factorization of Dickson Polynomials over Finite Fields

✍ Wun-Seng Chou 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 257 KB

Let T n (x, a) ʦ GF(q)[x] be a Dickson polynomial over the finite field GF(q) of either the first kind or the second kind of degree n in the indeterminate x and with parameter a. We give a complete description of the factorization of T n (x, a) over GF(q).