Skip to main navigation
Skip to search
Skip to main content
KAUST PORTAL FOR RESEARCHERS AND STUDENTS Home
Home
Profiles
Research units
Research output
Press/Media
Prizes
Courses
Equipment
Student theses
Datasets
Search by expertise, name or affiliation
The depth of decision trees for binary problems
M. Yu Moshkov
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The depth of decision trees for binary problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Decision Tree
100%
Worst Case
33%
Linear Function
33%
Logarithmic Function
33%
Number
33%
Computer Science
Decision Trees
100%
Linear Function
33%
Problem Description
33%
Logarithmic Function
33%
Keyphrases
Binary Problems
100%
Check System
33%