We show that for each iteration-free combinatorial circuit S over a basis B containing only monotone Boolean functions with at most five variables, there exists a decision tree for diagnosis of constant faults on inputs of gates with depth at most 7L(S) where L(S) is the number of gates in S. © 2013 Elsevier B.V. All rights reserved.
Bibliographical noteKAUST Repository Item: Exported on 2020-10-01
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics