Finding small equivalent decision trees is hard (Q5249043)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6432045
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding small equivalent decision trees is hard |
scientific article; zbMATH DE number 6432045 |
Statements
FINDING SMALL EQUIVALENT DECISION TREES IS HARD (English)
0 references
29 April 2015
0 references
decision trees
0 references
Boolean functions
0 references
NP-completeness
0 references
0.8293961882591248
0 references
0.8161341547966003
0 references
0.7692342400550842
0 references
0.7678186297416687
0 references
0.7632243037223816
0 references
