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:
“Of the thirty-six stratagems, the best is running away.”
—Chinese proverb.
“But you think ... that it is time for me to have done with the world, and so I would if I could get into a better before I was called into the best, and not die here in a rage, like a poisoned rat in a hole.”
—Jonathan Swift (1667–1745)