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 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 new American finds his challenge and his love in the traffic-choked streets, skies nested in smog, choking with the acids of industry, the screech of rubber and houses leashed in against one another while the townlets wither a time and die.”
—John Steinbeck (1902–1968)