Content deleted Content added
m more templatization |
eponyms |
||
Line 1:
In [[mathematics]], in particular in [[computational algebra]], the '''Berlekamp–Zassenhaus algorithm''' is an [[algorithm]] for factoring [[polynomial]]s over the [[integer]]s, named after [[Elwyn Berlekamp]] and [[Hans Zassenhaus]]. As a consequence of [[Gauss's lemma (number theory)|Gauss's lemma]], this amounts to solving the problem also over the rationals.
The algorithm starts by finding factorizations over suitable [[finite field]]s using [[Hensel's lemma]] to lift the solution from modulo a prime ''p'' to a convenient power of ''p''. After this the right factors are found as a subset of these.
| |||