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)
“Kicking the heart
with pain’s big boots running up and down
the intestines like a motorcycle racer.”
—Anne Sexton (1928–1974)
“For me, it’s enough! They’ve been here long enough—maybe too long. It’s a funny thing, though. All these years Fred was too busy to have much time for the kids, now he’s the one who’s depressed because they’re leaving. He’s really having trouble letting go. He wants to gather them around and keep them right here in this house.”
—Anonymous Parent. As quoted in Women of a Certain Age, by Lillian B. Rubin, ch. 2 (1979)