Algorithmic Problems. Local Approach

Mikhail Moshkov*

*Corresponding author for this work

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


In this chapter, we study algorithmic problems related to the local approach to the investigation of decision trees: problems of computation of the minimum complexity of deterministic, nondeterministic, and strongly nondeterministic decision trees, problems of construction of decision trees with the minimum complexity, and the problem of solvability of systems of equations over information systems. We study relationships among these problems and describe all variants of algorithmic problem behavior. We also discuss an algorithm for decision table construction and two algorithms that construct deterministic decision trees.

Original languageEnglish (US)
Title of host publicationIntelligent Systems Reference Library
Number of pages8
StatePublished - 2020

Publication series

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

ASJC Scopus subject areas

  • General Computer Science
  • Information Systems and Management
  • Library and Information Sciences


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

Cite this