Revision as of 00:22, 18 March 2013 edit CsDix (talk \| contribs) 12,914 edits smallcaps rather than link-like underlining, sentence casing, removed repeated "algorithm"s in groupnames (already in title), category ← Previous edit		Revision as of 00:25, 18 March 2013 edit undo CsDix (talk \| contribs) 12,914 edits exapnding abbreviations to avoid similarity with smallcaps Next edit →
Line 32: \| group3 = [[Integer factorization]] \| list3 = * [[~~continued~~Continued fraction factorization\|Continued fraction (CFRAC)]] * [[Dixon's factorization method\|Dixon's]] * [[Lenstra elliptic curve factorization\|Lenstra elliptic curve (ECM)]] * [[Euler's factorization method\|Euler's]] * [[Pollard's rho algorithm\|Pollard's rho]] * [[Pollard's p − 1 algorithm\|p − 1]] * [[Williams' p + 1 algorithm\|p + 1]] * [[Quadratic sieve\|Quadratic sieve (QS)]] * [[General number field sieve\|General number field sieve (GNFS)]] * ''[[Special number field sieve\|Special number field sieve (SNFS)]]'' * [[Rational sieve]] * [[Fermat's factorization method\|Fermat's]] Line 65: * [[Function field sieve]] \| group6 = [[Greatest common divisor~~\|GCD~~]] \| list6 = * [[~~binary~~Binary GCD algorithm\|Binary GCD]] * [[Euclidean algorithm\|Euclidean]] * [[Extended Euclidean algorithm\|Extended Euclidean]]

Template:Number-theoretic algorithms: Difference between revisions