Circuit minimization for Boolean functions

（重定向自Logic 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.

单词	Logic minimization
释义	Logic minimization 英语百科 Circuit minimization for Boolean functions （重定向自Logic 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.
随便看	nonmechanical printer的意思 nonmechanistic的意思 nonmechanistically的意思 nonmechanizable的意思 nonmechanized的意思 non mechanized的意思 nonmechanized coal mining的意思 nonmechanized hump的意思 nonmechanized vehicles的意思 nonmedia的意思 nonmedial的意思 nonmedian的意思 nonmediastinal的意思 nonmediated的意思 nonmediating的意思 nonmediator的意思 nonmediators的意思 nonmedical的意思 Non Medical Internship的意思 Nonmedical Internship的意思 Non Medical Internships的意思 Nonmedical Internships的意思 nonmedicalized的意思 nonmedically的意思 Nonmedical Residencies的意思