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:

    Within the circuit of this plodding life
    There enter moments of an azure hue,
    Untarnished fair as is the violet
    Or anemone, when the spring strews them
    By some meandering rivulet, which make
    The best philosophy untrue that aims
    But to console man for his grievances.
    I have remembered when the winter came,
    Henry David Thoreau (1817–1862)