Berlekamp–Zassenhaus algorithm: Difference between revisions

Revision as of 10:45, 7 May 2021

Latest revision as of 02:11, 13 May 2024

(4 intermediate revisions by 3 users not shown)

Line 1:

{{Orphanformat footnotes |date=SeptemberMay 20182024}}

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 7 ⟶ 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 17 ⟶ 19:

| volume = 46

| year = 1967

| issue = 8 | doi=10.1002/j.1538-7305.1967.tb03174.x}}.

*{{citation

| last = Berlekamp | first = E. R. | authorlink = Elwyn Berlekamp

Line 27 ⟶ 29:

| title = Factoring polynomials over large finite fields

| volume = 24

| year = 1970| issue = 111 | doi-access = free

}}.

*{{citation

Line 56 ⟶ 58:

| title = Algorithms for computer algebra

| year = 1992

| bibcode = 1992afca.book.....G

| url-access = registration

| url = https://archive.org/details/algorithmsforcom0000gedd

Line 78 ⟶ 81:

| title = On Hensel factorization. I

| volume = 1

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

}}.

==External links==

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

==See also==

*[[Berlekamp's algorithm]]

{{DEFAULTSORT:Berlekamp-Zassenhaus algorithm}}

[[Category:Computer algebra]]