Trading time for space in prime number sieves

Jonathan P Sorenson

doi:10.1007/BFb0054861

Trading time for space in prime number sieves

Butler University

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Original language	American English
Title of host publication	Proceedings of the Third International Symposium on Algorithmic Number Theory (ANTS-III)
DOIs	https://doi.org/10.1007/BFb0054861
State	Published - 1998

Disciplines

Theory and Algorithms
Number Theory

Access to Document

10.1007/BFb0054861License: Unspecified

Cite this

@inbook{7eceff09bf174f4a8366c3e3e787a687,

title = "Trading time for space in prime number sieves",

author = "Sorenson, {Jonathan P}",

note = "Part of the Lecture Notes in Computer Science book series (LNCS, volume 1423) 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.",

year = "1998",

doi = "10.1007/BFb0054861",

language = "American English",

booktitle = "Proceedings of the Third International Symposium on Algorithmic Number Theory (ANTS-III)",

}

TY - CHAP

T1 - Trading time for space in prime number sieves

AU - Sorenson, Jonathan P

N1 - Part of the Lecture Notes in Computer Science book series (LNCS, volume 1423) 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.

PY - 1998

Y1 - 1998

UR - https://doi.org/10.1007/BFb0054861

U2 - 10.1007/BFb0054861

DO - 10.1007/BFb0054861

M3 - Chapter

BT - Proceedings of the Third International Symposium on Algorithmic Number Theory (ANTS-III)

ER -

Trading time for space in prime number sieves

Disciplines

Access to Document

Other files and links

Cite this