Revision as of 20:58, 24 July 2011 edit Bender235 (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers, Template editors 472,805 edits →References ← Previous edit		Revision as of 03:49, 11 November 2011 edit undo 138.16.109.55 (talk) →Complexity Next edit →
Line 105: ==Complexity== The running time is approximately O(<math>\sqrt{np}</math>) ~~for~~where ap ~~number~~is ''n''s smallest prime factor. ==References==

Pollard's rho algorithm for logarithms: Difference between revisions