Effective Hilbert irreducibility
From MaRDI portal
Publication:3708878
DOI10.1016/S0019-9958(85)80056-5zbMath0584.12019MaRDI QIDQ3708878
Publication date: 1985
Published in: Information and Control (Search for Journal in Brave)
polynomial factorizationeffective version of Hilbert irreducibility theoremprobabilistic irreducibility criterion
Software, source code, etc. for problems pertaining to commutative algebra (13-04) Polynomials in real and complex fields: factorization (12D05) Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials over finite fields (11T06) Polynomials (irreducibility, etc.) (11R09) Software, source code, etc. for problems pertaining to field theory (12-04)
Related Items
New Sparse Multivariate Polynomial Factorization Algorithms over Integers ⋮ Factoring multivariate polynomials represented by black boxes: a Maple + C implementation ⋮ On some regularity condition ⋮ Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators ⋮ Improved dense multivariate polynomial factorization algorithms ⋮ Computational complexity of sentences over fields ⋮ A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\) ⋮ Latin square determinants II ⋮ Sentences over integral domains and their computational complexities
