In this lecture, I will explain how certain modular methods can improve the total efficiency of polynomial algorithms based on two typical examples, Gröbner basis computation and Galois group computation.