On the Efficiency of a Polynomial Irreducibility Test

DOI10.1145/322063.322071zbMath0372.68014OpenAlexW1971961102MaRDI QIDQ4148947

David R. Musser

Publication date: 1978

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322063.322071

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomials in real and complex fields: factorization (12D05) Polynomials (irreducibility, etc.) (11R09)

Related Items (8)

Ewens Sampling and Invariable Generation ⋮ Univariate polynomial factorization over finite fields ⋮ On Polynomial Factorization Over Finite Fields ⋮ Digital collections of examples in mathematical sciences ⋮ Methodologies of Symbolic Computation ⋮ A heuristic irreducibility test for univariate polynomials ⋮ Four random permutations conjugated by an adversary generateS_nwith high probability ⋮ Fast recognition of alternating and symmetric Galois groups

This page was built for publication: On the Efficiency of a Polynomial Irreducibility Test