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
Famous quotes containing the words running and/or time:
“Of all the thirty-six alternatives, running away is best.”
—Chinese proverb.
“Morality for the novelist is expressed not so much in the choice of subject matter as in the plot of the narrative, which is perhaps why in our morally bewildered time novelists have often been timid about plot.”
—Jane Rule (b. 1931)