Skip to main navigation
Skip to search
Skip to main content
KAUST FACULTY PORTAL Home
Home
Profiles
Research units
Research output
Press/Media
Prizes
Courses
Equipment
Student theses
Datasets
Search by expertise, name or affiliation
Representing Boolean Functions by Decision Trees
Igor Chikalov
Computer, Electrical and Mathematical Sciences and Engineering
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Representing Boolean Functions by Decision Trees'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Computer Science
Decision Trees
100%
Boolean Function
100%
Time Complexity
33%
Space Complexity
33%
Logic Structure
16%
Graph Algorithms
16%
Representation Function
16%
Functional Element
16%
binary decision diagram
16%
Discrete Function
16%
Keyphrases
Branching Programs
50%
Minimal Time
16%
Minimum Space
16%
Compact Form
16%
Graph Algorithms
16%
Binary Decision Diagram
16%