Minimal TANT Networks of Functions with DON'T CARE'S and Some Complemented Input Variables
Vink · IEEE Transactions on Computers · 1978
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.