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:
“Kicking the heart
with pains big boots running up and down
the intestines like a motorcycle racer.”
—Anne Sexton (19281974)
“Regret for wasted time is more wasted time.”
—Mason Cooley (b. 1927)