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:
“But the ball is lost and the mallet slipped long since from the hands
Under the running tap that are not the hands of a child.”
—Louis MacNeice (1907–1963)
“Oh, it takes a long time and infinite patience to make them talk. Some day I’ll create a woman and it’ll be easier.”
—Waldemar Young, U.S. screenwriter. Erle C. Kenton. Dr. Moreau (Charles Laughton)