Content deleted Content added
Removed description of Pollard, that was subjective and not relevant to the subject matter of the article. |
m →Naming: clean up, References after punctuation per WP:REFPUNC and WP:CITEFOOT using AWB (8792) |
||
Line 41:
The second is "Pollard's lambda algorithm". Much like the name of another of Pollard's discrete logarithm algorithms, [[Pollard's rho algorithm for logarithms|Pollard's rho algorithm]], this name refers to the similarity between a visualisation of the algorithm and the [[Greek letter]] [[lambda]] (<math>\lambda</math>). The shorter stroke of the letter lambda corresponds to the sequence <math>\{x_i\}</math>, since it starts from the position b to the right of x. Accordingly, the longer stroke corresponds to the sequence <math>\{y_i\}</math>, which "collides with" the first sequence (just like the strokes of a lambda intersect) and then follows it subsequently.
Pollard has expressed a preference for the name "kangaroo algorithm",<ref>http://sites.google.com/site/jmptidcott2/</ref>
==See also==
| |||