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)
“Of all the thirty-six alternatives, running away is best.”
—Chinese proverb.
“Every time I think that I am getting old, and gradually going to the grave, something else happens.”
—Lillian Carter (1898–1983)