Skip to main content
SpringerLink
Log in
Book cover

International Algorithmic Number Theory Symposium

ANTS 1998: Algorithmic Number Theory pp 179–195Cite as

Trading time for space in prime number sieves

  • Conference paper
  • First Online:

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

Abstract

A prime number sieve is an algorithm that finds the primes up to a bound n. We present four new prime number sieves. Each of these sieves gives new space complexity bounds for certain ranges of running times. In particular, we give a linear time sieve that uses only O(√n/(log log n)2) bits of space, an O l(n/ log log n) time sieve that uses O(n/((log n)l log log n)) bits of space, where l>1 is constant, and two super-linear time sieves that use very little space.

Supported by NSF Grant CCR-9626877

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.

References

  1. Adleman, L. M., Pomerance, C., Rumely, R.: On distinguishing prime numbers from composite numbers. Annals of Mathematics 117 (1983) 173–206

    Article  MATH  MathSciNet  Google Scholar 

  2. Bach, E.: Analytic Methods in the Analysis and Design of Number-Theoretic Algorithms. MIT Press, Cambridge (1985)

    Google Scholar 

  3. Bach, E., Shallit, J.: Algorithmic Number Theory, Vol. 1. MIT Press, Cambridge (1996)

    Google Scholar 

  4. Bays, C., Hudson, R.: The segmented sieve of Eratosthenes and primes in arithmetic progressions to 1012. BIT 17 (1977) 121–127

    Article  MATH  MathSciNet  Google Scholar 

  5. Bernstein, D. J.: Personal communication. (1998)

    Google Scholar 

  6. Dunten, B., Jones, J., Sorenson, J. P.: A space-efficient fast prime number sieve. Information Processing Letters 59 (1996) 79–84

    Article  MATH  MathSciNet  Google Scholar 

  7. Greene, D. H., Knuth, D. E.: Mathematics for the Analysis of Algorithms. 3rd edn. BirkhÄuser, Boston (1990)

    Google Scholar 

  8. Hardy, G. H., Wright, E. M.: An Introduction to the Theory of Numbers. 5th edn. Oxford University Press (1979)

    Google Scholar 

  9. Miller, G.: Riemann's hypothesis and tests for primality. Journal of Computer and System Sciences 13 (1976) 300–317

    MATH  MathSciNet  Google Scholar 

  10. Pomerance, C. (ed.): Cryptology and Computational Number Theory. Proceedings of Symposia in Applied Mathematics, Vol. 42. American Mathematical Society, Providence (1990)

    Google Scholar 

  11. Pritchard, P.: A sublinear additive sieve for finding prime numbers. Communications of the ACM 24(1) (1981) 18–23, 772

    Article  MATH  MathSciNet  Google Scholar 

  12. Pritchard, P.: Fast compact prime number sieves (among others). Journal of Algorithms 4 (1983) 332–344

    Article  MATH  MathSciNet  Google Scholar 

  13. Pritchard, P.: Linear prime-number sieves: A family tree. Science of Computer Programming 9 (1987) 17–35

    Article  MATH  MathSciNet  Google Scholar 

  14. Sorenson, J. P., Parberry, I.: Two fast parallel prime number sieves. Information and Computation 144(1) (1994) 115–130

    Article  MathSciNet  Google Scholar 

  15. Stroustrup, B.: The C++ Programming Language. 2nd edn. Addison-Wesley (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Butler University, 4600 Sunset Avenue, 46208, Indianapolis, Indiana, USA

    Jonathan P. Sorenson

Authors
  1. Jonathan P. Sorenson
    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

Sorenson, J.P. (1998). Trading time for space in prime number sieves. 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/BFb0054861

Download citation

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

  • 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