COMPARITIVE ANALYSIS OF DETERMINISTIC AND NONDETERMINISTIC DECISION TREE COMPLEXITY. GLOBAL APPROACH

Authors:
Mikhail Moshkov
Affiliations:
Research Institute for Applied Mathematics and Cybernetics of Nizhni Novgorod State University 10, Uljanova St., Nizhni Novgorod, 603005, Russia
Venue:
Fundamenta Informaticae
Year:
1996

Citing 6
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem

Journal of the ACM (JACM)
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Induction of Decision Trees

Machine Learning
Lower bounds for algebraic computation trees

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Optimization Problems For Decision Trees

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 investigate decision trees assuming a global approach i.e. arbitrary checks from a given check system can be used for constructing decision trees.