๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Complete analysis of a polynomial factorization algorithm over finite fields

โœ Scribed by Flajolet P., Gourdon X., Panario D.


Book ID
102573696
Year
2001
Tongue
English
Weight
257 KB
Series
J.Algorithms 40 p37
Category
Library

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Deterministic Analysis of Aleatoric Meth
โœ M. Rothstein; H. Zassenhaus ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 677 KB

We analyze the problem of finding the roots of an arbitrary polynomial over a finite field (equivalent to factoring an arbitrary polynomial over the field) and propose a deterministic approach which leads to a combinatorial problem whose satisfactory solution would yield a factoring method which is

Factoring Polynomials over a Finite Fiel
โœ Willett, Michael ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 530 KB
Factoring Polynomials Over a Finite Fiel
โœ Michael Willett ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 496 KB
Factoring Polynomials Over Finite Fields
โœ 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.