Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Garey, M.R., Jonson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., San Francisco (1979)
Moshkov, M.: Decision Trees. Theory and Applications (in Russian). Nizhny Novgorod University Publishers, Nizhny Novgorod (1994)
Moshkov, M.: Time complexity of decision trees. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets III, Lecture Notes in Computer Science, vol. 3400, pp. 244–459. Springer, Berlin (2005)
Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge, MA, USA (1987)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Moshkov, M. (2020). Algorithmic Problems. In: Comparative Analysis of Deterministic and Nondeterministic Decision Trees. Intelligent Systems Reference Library, vol 179. Springer, Cham. https://doi.org/10.1007/978-3-030-41728-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-030-41728-4_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-41727-7
Online ISBN: 978-3-030-41728-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)