Answers are grounded in this paper and cite their sources.
A binary-decision program is a program consisting of a string of two-address conditional transfer instructions. The paper shows the relationship between switching circuits and binary-decision programs and gives a set of simple rules by which one can transform binary-decision programs to switching circuits. It then shows that, in regard to the computation of switching functions, binary-decision programming representation is superior to the usual Boolean representation.
No takes yet. Share an insight, caveat, or question.
C. Y. Lee (1959) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: