Covering problems occur at several steps during logic synthesis including two-level minimization and DAG c o v ering. This paper presents a better lower bound computation algorithm and two new pruning techniques that signicantly improve the eciency of covering problem solvers. We show that these techniques reduce by u p t o three orders of magnitude the time required to solve c o vering problems exactly.