Answers are grounded in this paper and cite their sources.
Algorithms are presented which modify logical networks of bounded fan-in to obtain functionally equivalent networks of bounded fan-m and fan-out, so that both size and depth are not increased by more than constant factors.
No takes yet. Share an insight, caveat, or question.
Hoover et al. (1984) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: