Test Routines Based on Symbolic Logical Statements
Journal of the ACM (JACM)
Time complexity of decision trees
Transactions on Rough Sets III
On Algorithm for Constructing of Decision Trees with Minimal Depth
Fundamenta Informaticae
Hi-index | 0.04 |
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.