Advertisement

Basic Definitions and Notation

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

Abstract

In this chapter, we discuss main notions and notation for the global approach to the study of decision trees for problems. We consider different parameters of problems related to complexity of decision trees, relationships among these parameters, and upper and lower types of these relationships.

References

  1. 1.
    Moshkov, M.: Comparative analysis of deterministic and nondeterministic decision tree complexity, Global approach. Fundam. Inform. 25(2), 201–214 (1996)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Moshkov, M.: Unimprovable upper bounds on time complexity of decision trees. Fundam. Inform. 31(2), 157–184 (1997)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Moshkov, M.: Comparative analysis of deterministic and nondeterministic decision tree complexity, Local approach. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets IV, Lecture Notes in Computer Science, vol. 3700, pp. 125–143. Springer, Berlin (2005)Google 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