Basic Definitions and Notation
- 9 Downloads
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.
- 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