Optimization Problems For Decision Trees

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

Citing 0
Cited 2

Unimprovable Upper Bounds on Time Complexity of Decision Trees

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

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider decision trees with questions from an infinite set and time complexity measures. We investigate decidability conditions for two optimization problems for decision trees.