Algorithmic Problems

Mikhail Moshkov*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review


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 languageEnglish (US)
Title of host publicationIntelligent Systems Reference Library
Number of pages11
StatePublished - 2020

Publication series

NameIntelligent Systems Reference Library
ISSN (Print)1868-4394
ISSN (Electronic)1868-4408

Bibliographical note

Publisher 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


Dive into the research topics of 'Algorithmic Problems'. Together they form a unique fingerprint.

Cite this