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:
“I abide by a rule concerning reviews: I will never ask, neither in writing nor in person, that a word be put in about my book.... One feels cleaner this way. When someone asks that his book be reviewed he risks running up against a vulgarity offensive to authorial sensibilities.”
—Anton Pavlovich Chekhov (1860–1904)
“From time immemorial the men of the town have been famous seamen, and have divided their energies between fishing and hating the English.”
—Willa Cather (1876–1947)