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:
“You know what I like about your program? Even when I’m running the vacuum, I can understand it.”
—Joseph L. Mankiewicz (1909–1993)
“There is every reason to rejoice with those self-styled prophets of commercial disaster, those harbingers of gloom,
Over the imminent lateness of the denouement that, advancing slowly, never arrives,
At the same time keeping the door open to a tongue-in-cheek attitude on the part of the perpetrators....”
—John Ashbery (b. 1927)