| http://www.w3.org/ns/prov#value | - should really be called the Multiple Arithmetic Progression Quadratic Sieve), which uses the same polynomial f(x) = x^2 - N as normal, but instead of taking values of x close to the square root of N, takes values of x with x^2 < 2 N and within arithmetic progressions such that x^2 - N is a multiple of the square of a large prime.
|
