Constructing optimal binary decision trees is NP-complete (Q1228355)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructing optimal binary decision trees is NP-complete |
scientific article |
Statements
Constructing optimal binary decision trees is NP-complete (English)
0 references
1976
0 references
