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:
“I tawt I taw a puddy tat a-cweepin’ up on me.”
—Bob Clampett, U.S. animator. Tweety’s running gag, in Looney Tunes/Merrie Melodies (animation series)
“The man who spends all his time looking up to heaven is not always the best; in fact, he is usually the worst.”
—José Bergamín (1895–1983)