In computer algebra when doing effective computations with integer polynomials often the following strategy is applied. One reduces a polynomial f modulo a suitable prime number p to get f_p, solves a related problem over \mathbb{Z}/p\mathbb{Z} instead of \mathbb{Z} which is often simpler, and finally uses Hensel lifting to transfer the result for f_p back to f.
