Affiliation:
1. Computer Science Department, University Politehnica of Bucharest, Splaiul Independentei 313, 060042 Bucharest, Romania
Abstract
In a landscape where interest in prime sieving has waned and practitioners are few, we are still hoping for a domain renaissance, fueled by a resurgence of interest and a fresh wave of innovation. Building upon years of extensive research and experimentation, this article aims to contribute by presenting a heterogeneous compilation of generic tweaks and boosters aimed at revitalizing prime sieving methodologies. Drawing from a wealth of resurfaced knowledge and refined sieving algorithms, techniques, and optimizations, we unveil a diverse array of strategies designed to elevate the efficiency, accuracy, and scalability of prime sieving algorithms; these tweaks and boosters represent a synthesis of old wisdom and new discoveries, offering practical guidance for researchers and practitioners alike.
Reference31 articles.
1. Algorithm 35: Sieve;Wood;Commun. ACM,1961
2. D’Ooge., M.L. (1926). Introduction to Arithmetic, Macmillan.
3. Sundaram’s Sieve for Prime Numbers;Aiyar;Math. Stud.,1934
4. Helfgott, H.A. (2019). An Improved Sieve of Eratosthenes. arXiv.
5. Algorithm 310: Prime Number Generator 1;Chartres;Commun. ACM,1967