Comparative Analysis of Deterministic and Nondeterministic Decision Tree Complexity. Global Approach Mikhail Moshkov
unknown authors
http://alfa.mimuw.edu.pl/logic/prace/1996/D6/moshkov_FI96.ps
Add To MetaCart
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.
Citations
| 2489 | Induction of Decision Trees – Quinlan - 1986 |
| 1541 | Computational Geometry: An Introduction – Preparata, Shamos - 1985 |
| 536 | Rough Sets: Theoretical Aspects of Reasoning about Data – Pawlak - 1991 |
| 123 | The discernibility matrices and functions in information systems – SKOWRON, RAUSZER - 1992 |
| 13 | auf der Heide, A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem – Meyer - 1984 |
| 7 | Logical methods for electric circuit control – Chegis, Yablonskii - 1958 |
| 7 | Decision Trees. Theory and Applications – Moshkov - 1994 |
| 5 | Theorie des Questionnaires – Picard - 1965 |
| 4 | Programs from decision tables – Humby - 1973 |
| 2 | Decision trees with quasilinear checks – Moshkov - 1994 |
| 2 | Optimization problems for decision trees – Moshkov - 1994 |
| 1 | Lower bounds for algebraic computation trees – Ben-0r - 1983 |
| 1 | On the conditional tests, Dokl – Moshkov - 1982 |
| 1 | Conditional tests, in Problemy Cyberneticy, Edited by S – Moshkov - 1983 |
| 1 | Method of Opponent Strategy – Tarasova - 1988 |
