Tag Info

New answers tagged


Restating the comments: a = Boole[3 < 2] b = 3 a * b (* -> 0 *)


This answer is a modification of my answer given in the discussion Creating Identification/Classification trees. With this solution I am trying to achieve the simplification by using the impurity function applied to the data (the truth table in this case). Make the truth table from the linked Wikipedia article (Binary Decision Diagram): truthTable = {{0, ...


The problem of finding the variable order that minimizes the number of nodes in a given reduced ordered binary decision diagram is NP-hard. So, it is typically not used very much. It is implemented in CUDD as CUDD_REORDER_EXACT. Rudell's sifting is the algorithm most frequently used. In both a brute force computation of the optimal order, as well as ...

Top 50 recent answers are included