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:
“I must down to the seas again for the call of the running tide Is a wild call and a clear call that may not be denied.”
—John Masefield (1874–1967)
“The principle of asceticism never was, nor ever can be, consistently pursued by any living creature. Let but one tenth part of the inhabitants of the earth pursue it consistently, and in a day’s time they will have turned it into a Hell.”
—Jeremy Bentham (1748–1832)