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:
“This place is the longest running farce in the West End.”
—Cyril Smith (b. 1928)
“Twilight and evening bell.
And after that the dark!
And may there be no sadness of farewell,
When I embark;
For though from out our bourne of Time and Place
The flood may bear me far,
I hope to see my Pilot face to face
When I have crossed the bar.”
—Alfred Tennyson (1809–1892)