Circuit Minimization

In Boolean algebra, circuit minimization is the problem of obtaining the smallest logic circuit (Boolean formula) that 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.

Read more about Circuit Minimization:  Purpose, Example

Famous quotes containing the word circuit:

    We are all hostages, and we are all terrorists. This circuit has replaced that other one of masters and slaves, the dominating and the dominated, the exploiters and the exploited.... It is worse than the one it replaces, but at least it liberates us from liberal nostalgia and the ruses of history.
    Jean Baudrillard (b. 1929)