Berlekamp–Zassenhaus algorithm: Difference between revisions

Revision as of 12:46, 26 November 2015

Revision as of 16:05, 17 September 2018

Line 1:

{{Orphan|date=September 2018}}

In [[mathematics]], in particular in [[computer algebra|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.