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:
“What is the most rigorous law of our being? Growth. No smallest atom of our moral, mental, or physical structure can stand still a year. It grows—it must grow; nothing can prevent it.”
—Mark Twain [Samuel Langhorne Clemens] (1835–1910)
“I don’t think that a leader can control to any great extent his destiny. Very seldom can he step in and change the situation if the forces of history are running in another direction.”
—Richard M. Nixon (1913–1995)
“The ideal of the self-sufficient American family is a myth, dangerous because most families, especially affluent families, do in fact make use of a range of services to survive. Families needing one or another kind of help are not morally deficient; most families do need assistance at one time or another.”
—Joseph Featherstone (20th century)