Berlekamp–Zassenhaus algorithm: Difference between revisions

Revision as of 05:21, 15 November 2021

Revision as of 07:34, 9 December 2021

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.