Lower bounds for lengths of single tests for Boolean circuits
Кирилл Андреевич Попков · Discrete Mathematics and Applications · 2019
Abstract We obtain nontrivial lower bounds for lengths of minimal single fault detection and diagnostic tests for Boolean circuits in wide classes of bases in presence of stuck-at faults at outputs of circuit gates.