Revision as of 12:27, 19 April 2011 edit 14.139.128.15 (talk) →Core result ← Previous edit		Revision as of 17:51, 17 May 2011 edit undo BD2412 (talk \| contribs) Autopatrolled, Administrators 2,527,443 edits reversed pipe Next edit →
Line 1: In [[Computational mathematics\|computational]] [[Abstract algebra\|algebra]], the '''Cantor–Zassenhaus algorithm''' is a well known method for factorising [[polynomial]]s over [[finite field]]s (also called Galois fields). The algorithm consists mainly of exponentiation and polynomial [[greatest common divisor\|GCD]] computations. It was invented by D. Cantor and [[~~Zassenhaus\|~~Hans Zassenhaus]] in 1981. It is arguably the dominant algorithm for solving the problem, having replaced the earlier [[Berlekamp's algorithm]] of 1967. It is currently implemented in many well-known [[computer algebra system]]s, including [[PARI/GP]].

Cantor–Zassenhaus algorithm: Difference between revisions