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.
Famous quotes containing the word circuit:
“each new victim treads unfalteringly
The never altered circuit of his fate,
Bringing twelve peers as witness
Both to his starry rise and starry fall.”
—Robert Graves (1895–1985)