Misplaced Pages

Berlekamp–Zassenhaus algorithm

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
This article includes inline citations, but they are not properly formatted. Please improve this article by correcting them. (May 2024) (Learn how and when to remove this message)

In mathematics, in particular in computational algebra, the Berlekamp–Zassenhaus algorithm is an algorithm for factoring polynomials over the integers, named after Elwyn Berlekamp and Hans Zassenhaus. As a consequence of Gauss's lemma, this amounts to solving the problem also over the rationals.

The algorithm starts by finding factorizations over suitable finite fields using Hensel's lemma to lift the solution from modulo a prime p to a convenient power of p. After this the right factors are found as a subset of these. The worst case of this algorithm is exponential in the number of factors.

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

References

External links


Stub icon

This algebra-related article is a stub. You can help Misplaced Pages by expanding it.

Stub icon

This algorithms or data structures-related article is a stub. You can help Misplaced Pages by expanding it.

Categories: