ABOUT THE DEPTH OF DECISION TREES COMPUTING BOOLEAN FUNCTIONS
Mikhail Moshkov · Fundamenta Informaticae · 1995
Lower and upper bounds for the depth of decision trees computing Boolean functions are established and Shannon functions of the decision tree depth are determined for closed classes of Boolean functions.