Rigorous Running Time
The Schnorr-Seysen-Lenstra probabilistic algorithm has been rigorously proven by Lenstra and Pomerance to have expected running time by replacing the GRH assumption with the use of multipliers. The algorithm uses the class group of positive binary quadratic forms of discriminant Δ denoted by GΔ. GΔ is the set of triples of integers (a, b, c) in which those integers are relative prime.
Read more about this topic: Integer Factorization
Famous quotes containing the words rigorous, running and/or time:
“A multitude of little superfluous precautions engender here a population of deputies and sub-officials, each of whom acquits himself with an air of importance and a rigorous precision, which seemed to say, though everything is done with much silence, “Make way, I am one of the members of the grand machine of state.””
—Marquis De Custine (1790–1857)
“This our life, exempt from public haunt,
Finds tongues in trees, books in the running brooks,
Sermons in stones, and good in every thing.”
—William Shakespeare (1564–1616)
“It is the time we have now, and all our wasted time sinks into the sea and is swallowed up without a trace. The past is dust and ashes, and this incommensurably wide way leads to the pragmatic and kinetic future.”
—John Ashbery (b. 1927)