Factoring polynomials with rational coefficients
- 1 December 1982
- journal article
- research article
- Published by Springer Nature in Mathematische Annalen
- Vol. 261 (4), 515-534
- https://doi.org/10.1007/bf01457454
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Irreducible polynomials with integral coefficients have succinct certificatesJournal of Algorithms, 1981
- Irreducibility testing and factorization of polynomialsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- A sublinear additive sieve for finding prime numberCommunications of the ACM, 1981
- Generalization of the Euclidean algorithm for real numbers to all dimensions higher than twoBulletin of the American Mathematical Society, 1979
- A remark on the Hensel factorization methodMathematics of Computation, 1978
- An inequality about factors of polynomialsMathematics of Computation, 1974
- On Hensel factorization, IJournal of Number Theory, 1969
- Approximate formulas for some functions of prime numbersIllinois Journal of Mathematics, 1962