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 never thought I’d have such a luxurious life. A healthy husband ... beautiful little girl ... Jacuzzi and beer and fruitbowl and Beethoven and Mendelssohn and running.... Running is the best thing. [Ellipses in original]”
—Miki Gorman (b. 1935)
“Time goes, you say? Ah, no!
Alas, Time stays, we go.”
—Henry Austin Dobson (1840–1921)