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:
“You know what I like about your program? Even when I’m running the vacuum, I can understand it.”
—Joseph L. Mankiewicz (1909–1993)
“Gather ye rosebuds while ye may:
Old Time is still a-flying;
And this same flower that smiles today,
Tomorrow will be dying.”
—Robert Herrick (1591–1674)