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:
“And this our life, exempt from public haunt,
Finds tongues in trees, books in the running brooks,
Sermons in stones, and good in everything.”
—William Shakespeare (1564–1616)
“Why is it so difficult—so degradingly difficult—to bring the notion of Time into mental focus and keep it there for inspection? What an effort, what fumbling, what irritating fatigue!”
—Vladimir Nabokov (1899–1977)