The research monograph is devoted to the study of bounds on time complexity in the worst
case of decision trees and algorithms for decision tree construction. The monograph is …

Decision trees and decision rule systems are widely used in different applications as
algorithms for problem solving, as predictors, and as a way for knowledge representation …

This book is devoted to the study of decision and inhibitory trees and rules for decision
tables with many-valued decisions. In conventional decision tables, a single decision is …

This book is devoted to the comparative analysis of deterministic, nondeterministic, and
strongly nondeterministic decision trees for problems over information systems. An …

Decision trees and decision rule systems are widely used in different applications as
algorithms for problem solving, as predictors, and as a way for knowledge representation …

The monograph is devoted to theoretical and experimental study of decision trees with a
focus on minimizing the average time complexity. The study resulted in upper and lower …

We study the relationships between the complexity of a task description and the minimal
complexity of deterministic and nondeterministic decision trees solving this task. We …

For problems over arbitrary information system we study the relationships among the
complexity of a problem description, the minimal complexity of a decision tree solving this …

In this paper, we study arbitrary infinite binary information systems each of which consists of
an infinite set called universe and an infinite set of two-valued functions (attributes) defined …

In this paper, we study arbitrary infinite binary information systems each of which consists of
an infinite set called universe and an infinite set of two-valued functions (attributes) defined …