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)
“The pleasure of jogging and running is rather like that of wearing a fur coat in Texas in August: the true joy comes in being able to take the damn thing off.”
—Joseph Epstein (b. 1937)
“The imagination of man is naturally sublime, delighted with whatever is remote and extraordinary, and running, without control, into the most distant parts of space and time in order to avoid the objects, which custom has rendered too familiar to it.”
—David Hume (1711–1776)