Heuristic Running Time
In number theory, there are many integer factoring algorithms that heuristically have expected running time
in o and L-notation. Some examples of those algorithms are the elliptic curve method and the quadratic sieve. Another such algorithm is the class group relations method proposed by Schnorr, Seysen, and Lenstra that is proved under of the Generalized Riemann Hypothesis (GRH).
Read more about this topic: Integer Factorization
Famous quotes containing the words running and/or time:
“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)
“Averageness is a quality we must put up with. Men march toward civilization in column formation, and by the time the van has learned to admire the masters the rear is drawing reluctantly away from the totem pole.”
—Frank Moore Colby (1865–1925)