Answers are grounded in this paper and cite their sources.
Gimpel has presented a minimization algorithm which realizes a minimal TANT network for any Boolean function, under a NAND gate cost criterion. Gimpel uses a covering closure (CC)-table and reduces this table with the reduction techniques of Grasselli and Luccio to find a least cost subset of implicants.
No takes yet. Share an insight, caveat, or question.
Vink et al. (1978) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: