Content deleted Content added
Citation bot (talk | contribs) Add: bibcode, issue. | Use this bot. Report bugs. | Suggested by Abductive | Category:Algorithms and data structures stubs | #UCB_Category 26/84 |
tag as format footnotes |
||
| (2 intermediate revisions by 2 users not shown) | |||
Line 1:
{{
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 79 ⟶ 81:
| title = On Hensel factorization. I
| volume = 1
| year = 1969| issue = 3 | bibcode = 1969JNT.....1..291Z | doi-access =
}}.
Line 85 ⟶ 87:
*{{mathworld|id=Berlekamp-ZassenhausAlgorithm|title=Berlekamp-Zassenhaus Algorithm|author=Domazet, Haris}}
▲==See also==
▲*[[Berlekamp's algorithm]]
[[Category:Computer algebra]]
| |||