Skip to main content
SpringerLink
Log in
Book cover

International Conference on Foundations of Software Technology and Theoretical Computer Science

FSTTCS 1986: Foundations of Software Technology and Theoretical Computer Science pp 263–269Cite as

Basis reduction and evidence for transcendence of certain numbers

  • Session 4 Theory
  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6 References

  • Hermite, Ch. Sur la fonction exponentielle. Oeuvres III (1873), 150–181.

    Google Scholar 

  • Kannan, R., A. Lenstra and L. Lovász. Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers. In Proceedings of the 16-th ACM Symposium on Theory of Computing (1984, Washington), 191–200.

    Google Scholar 

  • Kannan, R., L. McGeoch, and L. Tadj. Computational results on the subset sum problem. In preparation (1986).

    Google Scholar 

  • Lang, S.Algebra. Addison-Wesley, Reading, Massachusetts, 1965.

    Google Scholar 

  • Lang, S.Introduction to Transcendental Numbers. Addison-Wesley Series in Mathematics, 1966.

    Google Scholar 

  • Lenstra, A., H. Lenstra and L. Lovász Factoring polynomials with rational coefficients. Mathematische Annalen 261 (1982), 513–534.

    Google Scholar 

  • Lindenmann, F. Über die Zahl π. Math. Annalen 20 (1882), 213–225.

    Google Scholar 

  • Marcus, D.Number Fields. Springer Verlag, 1945.

    Google Scholar 

  • Schönhage, A. Factorization of univariate integer polynomials by Diophantine approximation and an improved basis reduction algorithm. In 11-th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science 172, Springer-Verlag, 1984, 436–447.

    Google Scholar 

  • Stewart, I., and D. Tall. Algebraic Number Theory. Chapman and Hall, London, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Carnegie-Mellon University, 15213, Pittsburgh, Pennsylvania, USA

    Ravi Kannan & Lyle A. McGeoch

Authors
  1. Ravi Kannan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lyle A. McGeoch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kesav V. Nori

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kannan, R., McGeoch, L.A. (1986). Basis reduction and evidence for transcendence of certain numbers. In: Nori, K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1986. Lecture Notes in Computer Science, vol 241. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17179-7_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-17179-7_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17179-9

  • Online ISBN: 978-3-540-47239-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation