Circuit minimization for Boolean functions

（重定向自Boolean 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 unbounded circuit minimization problem was long-conjectured to be $\Sigma_2^P$ -complete, a result finally proved in 2008, but there are effective heuristics such as Karnaugh maps and the Quine–McCluskey algorithm that facilitate the process.

单词	Boolean minimization
释义	Boolean minimization 英语百科 Circuit minimization for Boolean functions （重定向自Boolean 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 unbounded circuit minimization problem was long-conjectured to be $\Sigma_2^P$ -complete, a result finally proved in 2008, but there are effective heuristics such as Karnaugh maps and the Quine–McCluskey algorithm that facilitate the process.
随便看	stored fat stored file Stored food stored format instruction stored fuel stored fuel cooling stored fuel shielding stored goods stored grain insects stored heat stored heat method stored hologram store diagnostic program store, digital stored image stored information stored instruction stored liquid plasma stored locomotive stored logic stored logic array stored logic computer stored logic control stored logic controller stored logic telemetry