Sieving with powers of small primes in the Small Prime variation of the Quadratic Sieve
As I understand it, in the Small Prime Variation of the Quadratic Sieve, primes less than a threshold (P[SUB]min[/SUB], say) are not used for sieving, as the cost of sieving is disproportionately high given the contribution of these primes.
Sieving with powers of primes that are themselves used in sieving is also less beneficial than sieving with other primes of size comparable to these powers (e.g. the contribution for p^2 is the same as for p). However, it seems to me that for primes in the factor base less than P[SUB]min[/SUB] it ought still to make sense to sieve with the lowest powers that are P[SUB]min[/SUB] or above, as the contribution is just as high as that of similarlysized primes (why would I sieve with the prime 257 but not 256 (2[SUP]8[/SUP]), for example)? In the implementations I've looked at, this does not appear to be done, and I was wondering why; is the benefit outweighed by the added complexity? 
Once the problem size gets above a fairly small threshold, the runtime needed for sieving small primes becomes insignificant compared to sieving everything else; there are only a few such, and they cache nicely, so they're done in a flash compared to the thousands of larger primes you must also sieve with.

[QUOTE=jasonp;433185]Once the problem size gets above a fairly small threshold, the runtime needed for sieving small primes becomes insignificant compared to sieving everything else; there are only a few such, and they cache nicely, so they're done in a flash compared to the thousands of larger primes you must also sieve with.[/QUOTE]
Makes sense  thanks Jason. 
All times are UTC. The time now is 20:19. 
Powered by vBulletin® Version 3.8.11
Copyright ©2000  2021, Jelsoft Enterprises Ltd.