We consider the problem of enumerating the prime implicants of a given discrete function as a basic task of circuit theory. First, we count PI's for random Boolean functions. Then we use the well known lattice differentiation as a tool for finding implicants. The concept of a peak admits ...