Journal article · 1976

Constructing optimal binary decision trees is NP-complete

Laurent Hyafil, Ronald L. Rivest

Information Processing Letters, 5(1), 15–17 · Published 1 May 1976 · DOI 10.1016/0020-0190(76)90095-8

View at the publisherCite this paper

In brief

“Constructing optimal binary decision trees is NP-complete” is a 1976 journal article by Laurent Hyafil and Ronald L. Rivest, published in Information Processing Letters. OpenAlex counts 1,286 citations as of 20 November 2026, which puts it in the top 1% of works published in 1976 by citations. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
1,286
Most cited in
2024 (82)
Field-weighted impact
1.37
References
7
Authors
2

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Hyafil, L., & Rivest, R. L. (1976). Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1), 15–17. https://doi.org/10.1016/0020-0190(76)90095-8

MLA 9

Hyafil, Laurent, and Ronald L. Rivest. “Constructing optimal binary decision trees is NP-complete.” Information Processing Letters, vol. 5, no. 1, 1976, pp. 15–17. https://doi.org/10.1016/0020-0190(76)90095-8.

Chicago

Hyafil, Laurent and Ronald L. Rivest. 1976. “Constructing optimal binary decision trees is NP-complete.” Information Processing Letters 5 (1): 15–17. https://doi.org/10.1016/0020-0190(76)90095-8.

Harvard

Hyafil, L. and Rivest, R. L. (1976) ‘Constructing optimal binary decision trees is NP-complete’, Information Processing Letters, 5(1), pp. 15–17. doi:10.1016/0020-0190(76)90095-8.

IEEE

L. Hyafil and R. L. Rivest, “Constructing optimal binary decision trees is NP-complete,” Information Processing Letters, vol. 5, no. 1, pp. 15–17, 1976, doi: 10.1016/0020-0190(76)90095-8.

BibTeX

@article{hyafil1976constructing,
  title     = {{Constructing optimal binary decision trees is NP-complete}},
  author    = {Hyafil, Laurent and Rivest, Ronald L.},
  journal   = {Information Processing Letters},
  year      = {1976},
  volume    = {5},
  number    = {1},
  pages     = {15--17},
  doi       = {10.1016/0020-0190(76)90095-8},
  url       = {https://doi.org/10.1016/0020-0190(76)90095-8}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
20175959
20184747
20195353
20206666
20217878
20227676
20237878
20248282
20255959
20266969

Its field-weighted citation impact is 1.37: it has been cited 1.37 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs

  • binary decision tree
  • NP-completeness
  • column generation
  • multi-class classification
  • cutting planes
  • discrete optimization

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Hyafil, L., & Rivest, R. L. (1976). Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1), 15–17. https://doi.org/10.1016/0020-0190(76)90095-8

How many times has this paper been cited?

1,286 times, according to OpenAlex on 20 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Laurent Hyafil, Ronald L. Rivest.

What is the DOI of this paper?

10.1016/0020-0190(76)90095-8, permanently at https://doi.org/10.1016/0020-0190(76)90095-8. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 20 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.