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:
“Of all the thirty-six alternatives, running away is best.”
—Chinese proverb.
“In time the scouring of wind and rain will wear down the ranges and plane off the region until it has the drab monotony of the older deserts. In the meantime—a two-million-year meantime—travelers may enjoy the cruel beauties of a desert in its youth,....”
—For the State of California, U.S. public relief program (1935-1943)