Finding the number of factors of a polynomial
From MaRDI portal
Publication:3329545
DOI10.1016/0196-6774(84)90025-7zbMath0542.12001OpenAlexW2073985094WikidataQ97611608 ScholiaQ97611608MaRDI QIDQ3329545
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
Polynomials (irreducibility, etc.) (11R09) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to field theory (12-04)
Related Items (6)
Irreducibility of multivariate polynomials ⋮ Univariate polynomial factorization over finite fields ⋮ Knottedness is in NP, modulo GRH ⋮ Cook's versus Valiant's hypothesis ⋮ Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy ⋮ On the complexity of torus knot recognition
This page was built for publication: Finding the number of factors of a polynomial