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)
“... with dozens of as yet
Unrealized projects, and a strict sense
Of time running out, of evening presenting
The tactfully folded-over bill?”
—John Ashbery (b. 1927)
“Every time I get happy
the Nana-hex comes through.
Birds turn into plumber’s tools,
a sonnet turns into a dirty joke,
a wind turns into a tracheotomy,
a boat turns into a corpse....”
—Anne Sexton (1928–1974)