Redundancy Testing in Combinational Networks
H.-P.S. Lee, Edward S. Davidson · IEEE Transactions on Computers · 1974
A simple, necessary and sufficient test is developed for testing whether a single connection in a tree-type NAND network is redundant. A procedure is presented for testing every connection in the network. The computational complexity of the procedure is mi2 where m = the number of gates and i = the average number of inputs per gate in the network.