In the previous chapters, we considered, mainly, approximate bounds on the minimum complexity and approximate algorithms for optimization of decision trees. In this chapter, we consider algorithmic problems of computation of the minimum complexity of deterministic, nondeterministic, and strongly nondeterministic decision trees, and of construction of decision trees with the minimum complexity.
|Original language||English (US)|
|Title of host publication||Intelligent Systems Reference Library|
|Number of pages||11|
|State||Published - 2020|
|Name||Intelligent Systems Reference Library|
Bibliographical notePublisher Copyright:
© 2020, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG.
ASJC Scopus subject areas
- Computer Science(all)
- Information Systems and Management
- Library and Information Sciences