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 Algorithms
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)
“Gossip is news running ahead of itself in a red satin dress.”
—Liz Smith (b. 1923)
““What can be shown?
What true love be?
All could be known or shown
If Time were but gone.””
—William Butler Yeats (1865–1939)