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:
“This place is the longest running farce in the West End.”
—Cyril Smith (b. 1928)
“I think it’s unfair for people to try to make successful blacks feel guilty for not feeling guilty.... We’re unique in that we’re not supposed to enjoy the things we’ve worked so hard for.”
—Patricia Grayson, African American administrator. As quoted in Time magazine, p. 59 (March 13, 1989)