Answers are grounded in this paper and cite their sources.
A straightforward efficient computer algorithm for synthesizing multiple-output NAND (NOR) switching networks is presented which takes practical fan-in and fan-out limitations of logic gates into account. The algorithm is highly iterative and hence is very suitable for realizing large-size switching functions by a digital computer. The algorithm has been programmed in Fortran and a great deal of statistical data has been obtained to demonstrate its efficiency in terms of gate count as well as computing time. It is also efficient for hand execution
No takes yet. Share an insight, caveat, or question.
Su et al. (1971) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: