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 the thirty-six stratagems, the best is running away.”
—Chinese proverb.
“A man was to live in that egg-shell day and night, a mile from the shore.... Think of making your bed thus in the crest of a breaker! To have the waves, like a pack of hungry wolves, eying you always, night and day, and from time to time making a spring at you, almost sure to have you at last.”
—Henry David Thoreau (1817–1862)