Skip to main content
SpringerLink
Log in

Bounding smooth integers (extended abstract)

  • Conference paper
  • First Online:
Algorithmic Number Theory (ANTS 1998)

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

Included in the following conference series:

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

References

  1. Joseph P. Buhler, Hendrik W. Lenstra, Jr., Carl Pomerance, Factoring integers with the number field sieve, in [10], 50–94.

    Google Scholar 

  2. E. Rodney Canfield, Paul Erdós, Carl Pomerance, On a problem of Oppenheim concerning “factorisatio numerorum”, Journal of Number Theory 17 (1983), 1–28.

    Article  MATH  MathSciNet  Google Scholar 

  3. Ronald L. Graham, Jaroslav NešetŘil, The mathematics of Paul Erdós, volume 1, Algorithms and Combinatorics 13, Springer-Verlag, Berlin, 1997.

    Google Scholar 

  4. Adolf Hildebrand, Gérald Tenenbaum, On integers free of large prime factors, Transactions of the AMS 296 (1986), 265–290.

    Article  MATH  MathSciNet  Google Scholar 

  5. Adolf Hildebrand, Gérald Tenenbaum, Integers without large prime factors, Journal de Théorie des Nombres de Bordeaux 5 (1993), 411–484.

    MATH  MathSciNet  Google Scholar 

  6. Simon Hunter, Jonathan Sorenson, Approximating the number of integers free of large prime factors, Mathematics of Computation 66 (1997), 1729–1741.

    Article  MATH  MathSciNet  Google Scholar 

  7. Donald E. Knuth, The art of computer programming, volume 1: fundamental algorithms, 2nd edition, Addison-Wesley, Reading, Massachusetts, 1973.

    Google Scholar 

  8. Donald E. Knuth, The art of computer programming, volume 2: seminumerical algorithms, 2nd edition, Addison-Wesley, Reading, Massachusetts, 1981.

    Google Scholar 

  9. Sergei Konyagin, Carl Pomerance, On primes recognizable in deterministic polynomial time, in [3], 176–198.

    Google Scholar 

  10. Arjen K. Lenstra, Hendrik W. Lenstra, Jr. (editors), The development of the number field sieve, Lecture Notes in Mathematics 1554, Springer-Verlag, Berlin, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Statistics, and Computer Science (M/C 249), The University of Illinois at Chicago, 60607-7045, Chicago, IL

    Daniel J. Bernstein

Authors
  1. Daniel J. Bernstein
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Joe P. Buhler

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bernstein, D.J. (1998). Bounding smooth integers (extended abstract). In: Buhler, J.P. (eds) Algorithmic Number Theory. ANTS 1998. Lecture Notes in Computer Science, vol 1423. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054856

Download citation

  • DOI: https://doi.org/10.1007/BFb0054856

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64657-0

  • Online ISBN: 978-3-540-69113-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation