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)
“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)
“Away went the messenger’s bicycle,
His serpent’s track went up the hill forever.
And all the time she stood there hot as fever
And cold as any icicle.”
—John Crowe Ransom (1888–1974)