algebra | Algebra | Lie algebra | linear algebra | Abstract algebra | Linear Algebra | Computational fluid dynamics | Lie Algebra | Hopf algebra | Clifford algebra | Virasoro algebra | computational fluid dynamics | Computational complexity theory | computational chemistry | Clifford Algebra | Kac-Moody algebra | IEEE Computational Intelligence Society | Hecke algebra | Filtered algebra | Elementary algebra | Computer algebra system | Computational Science Graduate Fellowship | Computational Mechanics | Computational mechanics | Computational intelligence | Computational Fluid Dynamics | computational complexity theory | Boolean algebra | Banach algebra | Affine Lie algebra |
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.