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:
“Every time I hear that word, I cringe. Fun! I think it’s disgusting; it’s just running around. It’s not my idea of pleasure.”
—Vivienne Westwood (b. 1941)
“O heavens! how short a time does it take to put an eternal end to a woman’s liberty!”
—Frances Burney (1752–1840)