Revision as of 05:01, 15 October 2006 edit STBot (talk \| contribs) 67,360 edits m clean up - bother me at my talk if I mess up using AWB ← Previous edit		Revision as of 13:37, 2 April 2007 edit undo Momotaro (talk \| contribs) 439 edits m link to pari/gp directly Next edit →
Line 3: 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 computer algebra system\|PARI-~~/GP]]. ==Overview== Line 46: ==Implementation in computer algebra systems== The Cantor-Zassenhaus algorithm may be accessed in the ~~GP-~~PARI/GP package using the [http://pari.math.u-bordeaux.fr/dochtml/html.stable/Arithmetic_functions.html#factorcantor factorcantor] command. ==See also==

Cantor–Zassenhaus algorithm: Difference between revisions