BooleanMinimize

利用可能

Find the minimal sum-of-products Boolean expression.

形式

BooleanMinimize[expr]

BooleanMinimize[expr, form]

BooleanMinimize[expr, form, cond]

検証済みの例BooleanMinimize[True] → True BooleanMinimize[(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)

Qurakで実行リファレンスを検索

トピック

Algebraic Transformations - Logical & Boolean Operations »
Boolean Computation - Conversion & Minimization
Discrete Mathematics - Boolean Computation »
Logic And Boolean Algebra - Boolean Computation »
New In70 Alphabetical Listing - B
New In70 Mathematics And Algorithms - Boolean Computation »

関連

BooleanConvert FullSimplify BooleanCountingFunction BooleanFunction SatisfiableQ BooleanMaxterms BooleanMinterms BooleanTable And BSplineBasis BSplineCurve BSplineFunction

全 6300 関数 · MCPクライアントから使う