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:
“Have Johnny fix him a sandwich or something. Any man running for the Senate has to wantsomething. Right, Bud?
Okay, start the bus then. And drive them over a cliff.”
—Jeremy Larner, U.S. screenwriter, and Michael Ritchie. John J. McKay (Melvin Douglas)
“To have no time for philosophy is to be a true philosopher.”
—Blaise Pascal (1623–1662)