Quote:
Originally Posted by jasonp
Other authors fix the number of primes making up A and then use a dictionary enumeration algorithm to go through all the combinations of candidate primes
jasonp

One can also treat each of the primes making up A as nodes in a hypercube
and select subsets of them via a Grey code. My code did this a long time
ago (before the SI in SIQS even became common knowledge). I was, at
that time using only a small number of primes (i.e. 4 or 5) in A.