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
Unimprovable upper bounds on time complexity of decision trees
Mikhail Moshkov
*
*
Corresponding author for this work
Research output
:
Contribution to journal
›
Article
›
peer-review
10
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Unimprovable upper bounds on time complexity of decision trees'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Decision Tree
100%
Upper Bound
100%
Shannon Function
50%
Computer Science
Time Complexity
100%
Decision Trees
100%
Keyphrases
Shannon Function
50%