Effective Hilbert irreducibility

DOI10.1016/S0019-9958(85)80056-5MaRDI QIDQ3708878zbMATH OpenFDO

Authors Erich L. Kaltofen

Publication date 1985

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(85)80056-5

zbMATH Keywords

effective version of Hilbert irreducibility theorempolynomial factorizationprobabilistic irreducibility criterion

Mathematics Subject Classification ID

Polynomials (irreducibility, etc.) (11R09) Polynomials over finite fields (11T06) Software, source code, etc. for problems pertaining to field theory (12-04) Polynomials in real and complex fields: factorization (12D05) Polynomials in general fields (irreducibility, etc.) (12E05) Software, source code, etc. for problems pertaining to commutative algebra (13-04)

Recommendations

• Irreducibility of multivariate polynomials
• scientific article; zbMATH DE number 1303540
• Irreducibility of random polynomials of bounded degree
• Effective Noether irreducibility forms and applications
• Publication:3035399

Cited in

(17)

• Latin square determinants II
• Sentences over integral domains and their computational complexities
• Shidlovskii irreducibility
• Effective Noether irreducibility forms and applications
• Improved dense multivariate polynomial factorization algorithms
• Factoring multivariate polynomials represented by black boxes: a Maple + C implementation
• A Quick and Dirty Irreducibility Test for Multivariate Polynomials over 𝔽_q
• scientific article; zbMATH DE number 1303540 (Why is no real title available?)
• Extended Hilbert Irreducibility and Its Applications
• scientific article; zbMATH DE number 1542868 (Why is no real title available?)
• A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\)
• New Sparse Multivariate Polynomial Factorization Algorithms over Integers
• On some regularity condition
• Derandomizing multivariate polynomial factoring for low degree factors
• Encounters in symbolic computation: ideas for the ages
• Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
• Computational complexity of sentences over fields

This page was built for publication: Effective Hilbert irreducibility

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