Effective Hilbert irreducibility
- 30 September 1985
- journal article
- Published by Elsevier in Information and Control
- Vol. 66 (3) , 123-137
- https://doi.org/10.1016/s0019-9958(85)80056-5
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial FactorizationSIAM Journal on Computing, 1985
- Factoring Polynomials over Algebraic Number FieldsSIAM Journal on Computing, 1985
- Factorization of multivariate polynomials over finite fieldsMathematics of Computation, 1985
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980
- On Hilbert's Irreducibility TheoremJournal of Number Theory, 1974
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970
- Zum Hilbertschen IrreduzibilitätssatzMathematische Annalen, 1926