Record
- Authors
- Hyafil, L.; Rivest, R. L.
- Year
- 1976
- Title
- Constructing optimal binary decision trees is NP-complete
- Published in
- Information Processing Letters
- Volume
- 5 (1)
- Pages
- 15–17
- Type
- Journal article
- Our note
- none yet
- Verification
- matched-by-title: found by title in an open index (same title, year and first author) (checked against OpenAlex, 2026-11-14).
Identifiers found: OpenAlex W1970074386 · DOI 10.1016/0020-0190(76)90095-8 - Id
hyafil-1976-constructing-optimal-binary-decision-trees-is
Cited on
- Introduction to Decision Trees read status: not stated
As cited
The pages cite this work in one form.
-
Hyafil, L., and Rivest, R. L. (1976). Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1), 15–17.
BibLaTeX
@article{hyafil-1976-constructing-optimal-binary-decision-trees-is,
author = {Hyafil, L. and Rivest, R. L.},
title = {{Constructing optimal binary decision trees is NP-complete}},
journaltitle = {Information Processing Letters},
date = {1976},
volume = {5},
number = {1},
pages = {15--17}
}