Factoring Polynomials over Algebraic Number Fields
- 1 February 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 14 (1) , 184-195
- https://doi.org/10.1137/0214015
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- A polynomial-time reduction from bivariate to univariate integral polynomial factorizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Irreducible polynomials with integral coefficients have succinct certificatesJournal of Algorithms, 1981
- The Subresultant PRS AlgorithmACM Transactions on Mathematical Software, 1978
- Number FieldsPublished by Springer Nature ,1977
- An inequality about factors of polynomialsMathematics of Computation, 1974
- The Calculation of Multivariate Polynomial ResultantsJournal of the ACM, 1971
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common DivisorsJournal of the ACM, 1971
- On Euclid's Algorithm and the Theory of SubresultantsJournal of the ACM, 1971
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970
- Systems of distinct representatives and linear algebraJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967