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:
“Swan/Mary Rutledge: Oh no, no. I’m not running away. I came here to get something, and I’m going to get it.
Col. Cobb: Yes, but San Francisco is no place for a woman.
Swan: Why not? I’m not afraid. I like the fog. I like this new world. I like the noise of something happening.... I’m tired of dreaming, Colonel Cobb. I’m staying. I’m staying and holding out my hands for gold—bright, yellow gold.”
—Ben Hecht (1893–1964)
“People get a bad impression of it by continually trying to treat it as if it was a bank clerk, who ought to be on time on Tuesday next, instead of philosophically seeing it as a painter, who may do anything so long as you don’t try to predict what.”
—Katharine Whitehorn (b. 1926)