Factoring polynomials with rational coefficients (original) (raw)

• 5856 Accesses
• 3137 Citations
• 55 Altmetric
• 4 Mentions
• Explore all metrics

Access this article

Log in via an institution

Subscribe and save

• Starting from 10 chapters or articles per month
• Access and download chapters and articles from more than 300k books and 2,500 journals
• Cancel anytime View plans

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

1. Adleman, L.M., Odlyzko, A.M.: Irreducibility testing and factorization of polynomials, to appear. Extended abstract: Proc. 22nd Annual IEEE Symp. Found. Comp. Sci., pp. 409–418 (1981)
2. Brentjes, A.J.: Multi-dimensional continued fraction algorithms. Mathematical Centre Tracts 145. Amsterdam: Mathematisch Centrum 1981
   Google Scholar
3. Cantor, D.G.: Irreducible polynomials with integral coefficients have succinct certificates. J. Algorithms2, 385–392 (1981)
   Article Google Scholar
4. Cassels, J.W.S.: An introduction to the geometry of numbers. Berlin, Heidelberg, New York: Springer 1971
   Google Scholar
5. Ferguson, H.R.P., Forcade, R.W.: Generalization of the Euclidean algorithm for real numbers to all dimensions higher than two. Bull. Am. Math. Soc.1, 912–914 (1979)
   Google Scholar
6. Hardy, G.H., Wright, E.M.: An introduction to the theory of numbers. Oxford: Oxford University Press 1979
   Google Scholar
7. Knuth, D.E.: The art of computer programming, Vol. 2, Seminumerical algorithms. Reading: Addison-Wesley 1981
   Google Scholar
8. Lenstra, A.K.: Lattices and factorization of polynomials, Report IW 190/81. Amsterdam: Mathematisch Centrum 1981
   Google Scholar
9. Lenstra, H.W., Jr.: Integer programming with a fixed number of variables. Math. Oper. Res. (to appear)
10. Mignotte, M.: An inequality about factors of polynomials. Math. Comp.28, 1153–1157 (1974)
    Google Scholar
11. Pritchard, P.: A sublinear additive sieve for finding prime numbers. Comm. ACM24, 18–23 (1981)
    Google Scholar
12. Barkley Rosser, J., Schoenfeld, L.: Approximate formulas for some functions of prime numbers. Ill. J. Math.6, 64–94 (1962)
    Google Scholar
13. Yun, D.Y.Y.: The Hensel lemma in algebraic manipulation. Cambridge: MIT 1974; reprint: New York: Garland 1980
    Google Scholar
14. Zassenhaus, H.: On Hensel factorization. I. J. Number. Theory1, 291–311 (1969)
    Google Scholar
15. Zassenhaus, H.: A remark on the Hensel factorization method. Math. Comp.32, 287–292 (1978)
    Google Scholar
16. Zassenhaus, H.: A new polynomial factorization algorithm (unpublished manuscript, 1981)

Download references

Author information

Authors and Affiliations

1. Mathematisch Centrum, Kruislaan 413, NL-1098 SJ, Amsterdam, The Netherlands
   A. K. Lenstra
2. Mathematisch Instituut, Universiteit van Amsterdam, Roetersstraat 15, NL-1018 WB, Amsterdam, The Netherlands
   H. W. Lenstra Jr.
3. Bolyai Institute, A. József University, Aradi vértanúk tere 1, H-6720, Szeged, Hungary
   L. Lovász

Authors

1. A. K. Lenstra
2. H. W. Lenstra Jr.
3. L. Lovász

Rights and permissions

About this article

Cite this article

Lenstra, A.K., Lenstra, H.W. & Lovász, L. Factoring polynomials with rational coefficients.Math. Ann. 261, 515–534 (1982). https://doi.org/10.1007/BF01457454

Download citation

• Received: 11 July 1982
• Issue date: December 1982
• DOI: https://doi.org/10.1007/BF01457454

Keywords