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 Algorithms
Famous quotes containing the words running and/or time:
“It is moot whether there be divinities
As I finish this play by Webster:
The street-cars are still running however
And the katharsis fades in the warm water of a yawn.”
—Allen Tate (1899–1979)
“My companion and I, having a minute’s discussion on some point of ancient history, were amused by the attitude which the Indian, who could not tell what we were talking about, assumed. He constituted himself umpire, and, judging by our air and gesture, he very seriously remarked from time to time, “you beat,” or “he beat.””
—Henry David Thoreau (1817–1862)