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:
“... feminist solidarity rooted in a commitment to progressive politics must include a space for rigorous critique, for dissent, or we are doomed to reproduce in progressive communities the very forms of domination we seek to oppose.”
—bell hooks (b. c. 1955)
“Of the thirty-six stratagems, the best is running away.”
—Chinese proverb.
“Quarrel not at all. No man resolved to make the most of himself, can spare time for personal contention. Still less can he afford to take all the consequences, including the vitiating of his temper, and the loss of self-control. Yield larger things to which you can show no more than equal right; and yield lesser ones, though clearly your own. Better give your path to a dog, than be bitten by him in contesting for the right. Even killing the dog would not cure the bite.”
—Abraham Lincoln (1809–1865)