Bounds on Complexity and Algorithms for Construction of Nondeterministic and Strongly Nondeterministic Decision Trees for Decision Tables

  • Mikhail MoshkovEmail author
Part of the Intelligent Systems Reference Library book series (ISRL, volume 179)


In this chapter, we consider bounds on the minimum complexity, an approach to proof of lower bounds, and algorithms for construction of nondeterministic and strongly nondeterministic decision trees. The bounds on complexity are true for arbitrary complexity functions. The approach to proof of lower bounds assumes that the complexity functions have the property \(\varLambda 2\). The considered algorithms require complexity functions having properties \(\varLambda 1\), \(\varLambda 2\), and \(\varLambda 3\).


  1. 1.
    Moshkov, M.: About the depth of decision trees computing Boolean functions. Fundam. Inform. 22(3), 203–215 (1995)MathSciNetCrossRefGoogle Scholar

Copyright information

© The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Computer, Electrical and Mathematical Science and Engineering DivisionKing Abdullah University of Science and TechnologyThuwalSaudi Arabia

Personalised recommendations