TAOCP 7.1.2 Exercise 20

Working

taocpmathematicsalgorithmsvolume-4project

Section 7.1.2: Boolean Evaluation

Exercise 20. ▶ [40] [40] (R. Schroeppel, 2004.) A Boolean chain is canalizing if it does not use the operators $\oplus$ or $\equiv$. Find the optimum cost, length, and depth of all 4-variable functions under this constraint. Does the footprint heuristic still give optimum results?

Verified: no
Solve time: 1m49s

Working