Answers are grounded in this paper and cite their sources.
The minimization algorithm of Gimpel realizes a minimal TANT network for any Boolean function under a NAND gate cost criterion. A TANT network is a three-level network composed of AND-NOT (i.e., NAND) gates, having only true (i.e., uncomplemented) input variables.
No takes yet. Share an insight, caveat, or question.
Vink (1978) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: