Constructing optimal binary decision trees is NP-complete (Q1228355)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Constructing optimal binary decision trees is NP-complete |
scientific article; zbMATH DE number 3521506
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructing optimal binary decision trees is NP-complete |
scientific article; zbMATH DE number 3521506 |
Statements
Constructing optimal binary decision trees is NP-complete (English)
0 references
1976
0 references
