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:
““Would you—be good enough—” Alice panted out, after running a little further, “to stop a minute—just to get—one’s breath again?”
“I’m good enough,” the King said, “only I’m not strong enough. You see, a minute goes by so fearfully quick. You might as well try to stop a Bandersnatch!””
—Lewis Carroll [Charles Lutwidge Dodgson] (1832–1898)
“The times are so peculiar now, so mediaeval so unreasonable that for the first time in a hundred years truth is really stranger than fiction. Any truth.”
—Gertrude Stein (1874–1946)