Quote:
Originally Posted by R.D. Silverman
You are 25 years too late with your suggestion. Read my 1987 paper:
The Multiple Polynomial Quadratic Sieve
Math. Comp. 1987

I thought MPQS uses P(x) = (Ax + B)^2  n, which is very different from what I suggested. Although I don't see why even MPQS might not be improved by using multiples of n in its polynomials.