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:
“What is the most rigorous law of our being? Growth. No smallest atom of our moral, mental, or physical structure can stand still a year. It grows—it must grow; nothing can prevent it.”
—Mark Twain [Samuel Langhorne Clemens] (1835–1910)
“Frances Stevens: Mother, this is why I’ve had to spend half my life running around the world after you—to keep men like this away from you.
Mrs. Stevens: Well after this, let me run my own interference. It looks like the blockers are having all the fun.”
—John Michael Hayes (b. 1919)
“making what’s new
Ill and good, old, for as we die in you,
You die in Time, Time in Eternity.”
—Edward Herbert (1583–1648)