Computes a decision tree with the smallest number of nodes of a given Boolean function. Complexity 3^n if there are 2^n arguments to the function.
See the example in the file foo.pdf!
-
Notifications
You must be signed in to change notification settings - Fork 0
esraiak/decision_trees
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Computes a decision tree with the smallest number of nodes of a given Boolean function. Complexity 3^n if there are 2^n arguments to the function.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published