Circuit minimization

Circuit minimization is a well known problem in Boolean algebra, and refers to the task of obtaining the smallest logic circuit (Boolean formula) which represents a given Boolean function or truth table. The general circuit minimization problem is believed to be intractable, but there are effective heuristics such as Karnaugh maps and the Quine–McCluskey algorithm that facilitate the process.