Rigorous Running Time
The Schnorr-Seysen-Lenstra probabilistic algorithm has been rigorously proven by Lenstra and Pomerance to have expected running time by replacing the GRH assumption with the use of multipliers. The algorithm uses the class group of positive binary quadratic forms of discriminant Δ denoted by GΔ. GΔ is the set of triples of integers (a, b, c) in which those integers are relative prime.
Read more about this topic: Integer Factorization
Famous quotes containing the words rigorous, running and/or time:
“For rigorous teachers seized my youth,
And purged its faith, and trimm’d its fire,
Show’d me the high, white star of Truth,
There bade me gaze, and there aspire.
Even now their whispers pierce the gloom:
What dost thou in this living tomb?”
—Matthew Arnold (1822–1888)
“It was far in the sameness of the wood;
I was running with joy on the Demon’s trail,
Though I knew what I hunted was no true god.”
—Robert Frost (1874–1963)
“Almost one half of our time is spent in telling and hearing evil of one another ... and every hour brings forth something strange and terrible to fill up our discourse and our astonishment.”
—Laurence Sterne (1713–1768)