Skip to main content
SpringerLink
Log in

Factorization of polynomials by transcendental evaluation

  • Algebraic Algorithms II
  • Conference paper
  • First Online:
EUROCAL '85 (EUROCAL 1985)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 204))

Included in the following conference series:

Abstract

A new polynomial-time algorithm for the factorization of polynomials in two variables with rational coefficients is presented. The algorithm works by replacing one of the variables by an approximation of a transcendental number. It generalizes recent results by Kannan, Lenstra, Lovász [KLL] and Schőnhage [Sch2]. Asymptotically the algorithm improves on the running times of previously published methods.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.L. Chistov, D.Yu. Grigoryev, Polynomial-time factoring of the multivariable polynomials over a global field, Lomi, preprint E-5-82, Leningrad 1982.

    Google Scholar 

  2. P.L. Cijsouw, Transcendence measures, Ph.D. Thesis, University of Amsterdam, 1972.

    Google Scholar 

  3. A.O. Gel'fond, Transcendental and algebraic numbers, Dover Publ., New York 1960.

    Google Scholar 

  4. A.J. Goldstein, R.L. Graham, A Hadamard-type bound on the coefficients of a determinant of polynomials, SIAM Rev. 16 (1974), 394–395.

    Google Scholar 

  5. E. Kaltofen, On the complexity of factoring polynomials with integer coefficients, Ph.D. Thesis, Rensselaer Polytechnic Institute, 1982.

    Google Scholar 

  6. R. Kannan, A.K. Lenstra, L. Lovász, Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers, Proceedings 16th STOC, 1984.

    Google Scholar 

  7. A.K. Lenstra, Polynomial-time algorithms for the factorization of polynomials, Ph.D. Thesis, University of Amsterdam, 1984.

    Google Scholar 

  8. A.K. Lenstra, H.W. Lenstra, Jr., L. Lovász, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982), 515–534.

    Article  Google Scholar 

  9. K. Mahler, On some inequalities for polynomials in several variables, J. London Math. Soc. 37 (1962), 341–344.

    Google Scholar 

  10. A.M. Ostrowski, Solution of equations and systems of equations, Academic Press, New York 1966.

    Google Scholar 

  11. A. Schőnhage, The fundamental theorem of algebra in terms of computational complexity, Preliminary report, Math. Inst. Univ. Tűbingen, 1982.

    Google Scholar 

  12. A. Schőnhage, Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm, 11th Colloquium on automata, languages and programming, Lecture notes in computer science 172, Springer Verlag, Berlin, 1984, 436–447.

    Google Scholar 

  13. J. Von Zur Gathen, Hensel and Newton methods in valuation rings, Math. Comp. 42, (1984), 637–661.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ITW, Universiteit van Amsterdam, The Netherlands

    Marc-Paul van der Hulst

  2. Department of Computer Science, The University of Chicago, USA

    Arjen K. Lenstra

Authors
  1. Marc-Paul van der Hulst
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arjen K. Lenstra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bob F. Caviness

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van der Hulst, MP., Lenstra, A.K. (1985). Factorization of polynomials by transcendental evaluation. In: Caviness, B.F. (eds) EUROCAL '85. EUROCAL 1985. Lecture Notes in Computer Science, vol 204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15984-3_246

Download citation

  • DOI: https://doi.org/10.1007/3-540-15984-3_246

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15984-1

  • Online ISBN: 978-3-540-39685-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation