Berlekamp–Zassenhaus algorithm: Difference between revisions

Revision as of 07:34, 9 December 2021

Latest revision as of 02:11, 13 May 2024

(One intermediate revision by one other user not shown)

Line 1:

{{format footnotes |date=May 2024}}

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.

Line 6:

{{harvtxt|Van Hoeij|2002}} improved this algorithm by using the [[LLL algorithm]], substantially reducing the time needed to choose the right subsets of mod ''p'' factors.

==See also==

*[[Berlekamp's algorithm]]

==References==

Line 78 ⟶ 81:

| title = On Hensel factorization. I

| volume = 1

| year = 1969| issue = 3 | bibcode = 1969JNT.....1..291Z | doi-access = free

}}.

Line 84 ⟶ 87:

*{{mathworld|id=Berlekamp-ZassenhausAlgorithm|title=Berlekamp-Zassenhaus Algorithm|author=Domazet, Haris}}

==See also==

*[[Berlekamp's algorithm]]

{{DEFAULTSORT:Berlekamp-Zassenhaus algorithm}}

[[Category:Computer algebra]]