Prime Number Sieving—A Systematic Review with Performance Analysis
Round 1
Reviewer 1 Report
Comments and Suggestions for AuthorsComments for author File: 
Comments.pdf
Author Response
Thank you very much for your kind review.
Reviewer 2 Report
Comments and Suggestions for AuthorsThe paper proposes a systematic review of the literature about prime number sieving starting from Eratosthenes until today.
It is established using existing databases with a rigorous method called PRISMA 2020. The theoretical complexity of each method is given.
E.g. SoP (the sieve of Pritchard in 1983) has complexity $O(N/\ln \ln N)$ given on p. 11 (algorithm 9). It is clearly a considerable improvement
over the basic SoE algorithm (Eratosthenes sieve) which has complexity $O(N \ln \ln N)$ given on p. 4 (algorithm 1) like SoA (the quadrativ sieve of Atkin)
considered on p. 11 (algorithm 11). Another improvement is with S357 thanks to parallelization made by Singleton in 1969. The later method applies new hardware and software techniques with a limited practical interest, according to the authors.
To summarize, the paper is well written, clean and exhaustive. It does not a add new knowledge to the subject but may be useful to encourage new research.
I propose to accept the paper in the present form.
Author Response
Thank you very much for your kind review.
