Minimization of decision trees is hard to approximate (Q2475411)
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 5246772
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimization of decision trees is hard to approximate |
scientific article; zbMATH DE number 5246772 |
Statements
Minimization of decision trees is hard to approximate (English)
0 references
11 March 2008
0 references
decision tree
0 references
nonapproximability
0 references
0.8293961882591248
0 references
0.8255494832992554
0 references
0.7667369246482849
0 references
0.7564217448234558
0 references
