✦ LIBER ✦

A new efficient factorization algorithm for polynomials over small finite fields

✍ Scribed by Harald Niederreiter

Book ID: 105173259
Publisher: Springer
Year: 1993
Tongue: English
Weight: 341 KB
Volume: 4
Category: Article
ISSN: 0938-1279
DOI: 10.1007/bf01386831

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A classification of algorithms for multi

A classification of algorithms for multiplying polynomials of small degree over finite fields

✍ Amir Averbuch; Nader H Bshouty; Michael Kaminski 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 620 KB

The Complete Analysis of a Polynomial Fa

The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields

✍ P. Flajolet; X. Gourdon; D. Panario 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 315 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.

Factorization of polynomials over finite

Factorization of polynomials over finite fields and decomposition of primes in algebraic number fields

✍ Ming-Deh A Huang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 446 KB

Factorization of solvable polynomials ov

Factorization of solvable polynomials over finite fields and the generalized Riemann hypothesis

✍ S. A. Evdokimov 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 638 KB

Counting irreducible factors of polynomi

Counting irreducible factors of polynomials over a finite field

✍ Arnold Knopfmacher; John Knopfmacher 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 728 KB

Counting irreducible factors of polynomials over a finite field, Discrete Mathematics, 112 (1993) 103-l 18. Let F,[X] denote a polynomial ring in an indeterminate X over a finite field IF,. Exact formulae are derived for (i) the number of polynomials of degree n in F,[X] with a specified number of i