Analysis of Ben-Or's polynomial irreducibility test

DOI<439::AID-RSA13>3.0.CO;2-U 10.1002/(SICI)1098-2418(199810/12)13:3/4<439::AID-RSA13>3.0.CO;2-UzbMath0960.11052OpenAlexW1997028057MaRDI QIDQ4705346

Daniel Panario, Bruce Richmond

Publication date: 19 December 1999

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199810/12)13:3/4<439::aid-rsa13>3.0.co;2-u

zbMATH Keywords

finite fieldspolynomialsirreducibilityaverage-case analysisBen-Or's algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Combinatorial probability (60C05) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items (7)

On the degrees of polynomial divisors over finite fields ⋮ Irregularities in the distributions of primes in function fields ⋮ Enumeration of decomposable combinatorial structures with restricted patterns ⋮ Factoring polynomials over finite fields: A survey ⋮ Analysis of Rabin's irreducibility test for polynomials over finite fields ⋮ Fast construction of irreducible polynomials over finite fields ⋮ Asymptotics of subtracted singularities for generating functions with small singularities

This page was built for publication: Analysis of Ben-Or's polynomial irreducibility test