Revision as of 09:16, 18 September 2006 edit Charles Matthews (talk \| contribs) Autopatrolled, Administrators 367,800 edits m →Background ← Previous edit		Revision as of 09:18, 18 September 2006 edit undo Charles Matthews (talk \| contribs) Autopatrolled, Administrators 367,800 edits m +cat Next edit →
Line 1: In [[mathematics]], particularly [[computer algebra\|computational algebra]], the Cantor-Zassenhaus algorithm is a well known method for factorising [[polynomial~~\|polynomials~~]]s over [[finite field\|finite fields]] (~~aka~~also ~~[[galois~~called ~~field\|~~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\|computer algebra systems]], including [[PARI-GP_computer_algebra_system\|PARI-GP]]. ==Overview== Line 52 ⟶ 56: [[Category:Computer algebra]] [[Category:Finite fields]]

Cantor–Zassenhaus algorithm: Difference between revisions