TY - CHAP
T1 - Algorithmic Problems
AU - Moshkov, Mikhail
N1 - Publisher Copyright:
© 2020, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2020
Y1 - 2020
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85083453697&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-41728-4_8
DO - 10.1007/978-3-030-41728-4_8
M3 - Chapter
AN - SCOPUS:85083453697
T3 - Intelligent Systems Reference Library
SP - 105
EP - 115
BT - Intelligent Systems Reference Library
PB - Springer
ER -