The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields
From MaRDI portal
Publication:2746437
DOI10.1006/jagm.2001.1158zbMath1024.11079OpenAlexW2120749565MaRDI QIDQ2746437
Xavier Gourdon, Daniel Panario, Philippe Flajolet
Publication date: 29 November 2001
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/13d25ea8543fd6b42d1d48c96ce98b204699bb3c
Nonnumerical algorithms (68W05) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)
Related Items
Smoothness test for polynomials defined over small characteristic finite fields ⋮ Estimating the number of roots of trinomials over finite fields ⋮ Computing in groups of Lie type ⋮ Univariate polynomial factorization over finite fields with large extension degree ⋮ Interval partitions and polynomial factorization ⋮ Faster individual discrete logarithms in finite fields of composite extension degree ⋮ Enumeration of decomposable combinatorial structures with restricted patterns ⋮ Calculating the set of orders of elements in the finite linear groups ⋮ Generating series for irreducible polynomials over finite fields ⋮ The standard factorization of Lyndon words: an average point of view ⋮ D?E?K=(1000)8 ⋮ Analysis of Rabin's irreducibility test for polynomials over finite fields ⋮ On the number of factorizations of polynomials over finite fields ⋮ Permutation polynomials and factorization ⋮ Faster initial splitting for small characteristic composite extension degree fields ⋮ Factorization patterns on nonlinear families of univariate polynomials over a finite field ⋮ Asymptotics of subtracted singularities for generating functions with small singularities
