Qurak

BooleanMinimize

可用

Find the minimal sum-of-products Boolean expression.

BooleanMinimize[expr]
BooleanMinimize[expr, form]
BooleanMinimize[expr, form, cond]
BooleanMinimize[True] → TrueBooleanMinimize[(a && b) || (!a && !b)] → (a && b) || ( !a && !b)BooleanMinimize[(a && b) || (b && c) || (a && c)] → (a && b) || (a && c) || (b && c)BooleanMinimize[Xor[a, b, c]] → (a && b && c) || (a && !b && !c) || ( !a && b && !c) || ( !a && !b && c)

主題

相關

全部 6300 個函式 · 從 MCP 用戶端使用這個