Algorithmic Problems

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


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.


  1. 1.
    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)Google Scholar
  2. 2.
    Moshkov, M.: Decision Trees. Theory and Applications (in Russian). Nizhny Novgorod University Publishers, Nizhny Novgorod (1994)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge, MA, USA (1987)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