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:
“Kicking the heart
with pain’s big boots running up and down
the intestines like a motorcycle racer.”
—Anne Sexton (1928–1974)
“the race is not to the swift, nor the battle to the strong, neither
yet bread to the wise, nor yet riches to men of understanding, nor yet
favour to men of skill; but time and chance happeneth to them all.”
—Bible: Hebrew Ecclesiastes (l. IX, 11)