Constructing optimal binary decision trees is NP-complete (Q56340228)
Jump to navigation
Jump to search
article by Laurent Hyafil & Ron Rivest published May 1976 in Information Processing Letters
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructing optimal binary decision trees is NP-complete |
article by Laurent Hyafil & Ron Rivest published May 1976 in Information Processing Letters |
Statements
Constructing optimal binary decision trees is NP-complete (English)
0 references
May 1976
0 references
5
0 references
1
0 references
15-17
0 references