Finding the number of factors of a polynomial

DOI10.1016/0196-6774(84)90025-7MaRDI QIDQ3329545zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Peter J. Weinberger

Publication date 1984

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(84)90025-7

zbMATH Keywords

algorithmGalois groupintegral polynomialnumber of irreducible factorsfactorizations modulo p

Mathematics Subject Classification ID

Polynomials (irreducibility, etc.) (11R09) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to field theory (12-04)

Recommendations

• Galois groups and the factorization of polynomials
• Computation of the Galois group of a polynomial with rational coefficients. II
• scientific article; zbMATH DE number 1253995
• On the number of irreducible factors of degree k dividing a given polynomial over GF(q)
• On the number of irreducible factors of a polynomial II

Cited in

(9)

• Knottedness is in NP, modulo GRH
• On the complexity of torus knot recognition
• Univariate polynomial factorization over finite fields
• New absolute irreducibility testing criteria and factorization of multivariate polynomials
• On the number of irreducible factors of degree k dividing a given polynomial over GF(q)
• Galois groups and the factorization of polynomials
• Irreducibility of multivariate polynomials
• Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy
• Cook's versus Valiant's hypothesis

This page was built for publication: Finding the number of factors of a polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3329545)