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:
“Do but consider this small dust, here running in the glass,
By atoms moved.
Could you believe that this the body was
Of one that loved?
And in his mistress’ flame playing like a fly,
Turned to cinders by her eye?
Yes, and in death as life unblest,
To have’t expressed,
Even ashes of lovers find no rest.”
—Ben Jonson (1572–1637)
“The greatest part of a writer’s time is spent in reading, in order to write; a man will turn over half a library to make one book.”
—Samuel Johnson (1709–1784)