Programming, Binary Decision Diagrams, Computer Science, Boolean.
cofactor (the case where x1 = 1) and the second is the negative cofactor (the case where x1 = 0). We can reduce F to a formula of n-1 variables by expanding to consider both of these cases. Shannon expansion. From https://en.wikipedia.org/wiki/Boole%27s_expansion_theorem. A BDD is a visualization