Journal article · 1982
Computers and Intractability: A Guide to the Theory of NP-Completeness (Michael R. Garey and David S. Johnson)
SIAM Review, 24(1), 90–91 · Published 1 January 1982 · DOI 10.1137/1024022
In brief
“Computers and Intractability: A Guide to the Theory of NP-Completeness (Michael R. Garey and David S. Johnson)” is a 1982 journal article by Juris Hartmanis, published in SIAM Review. OpenAlex counts 431 citations as of 15 November 2026, which puts it in the top 5% of works published in 1982 by citations. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 431
- Most cited in
- 2025 (83)
- Authors
- 1
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Hartmanis, J. (1982). Computers and Intractability: A Guide to the Theory of NP-Completeness (Michael R. Garey and David S. Johnson). SIAM Review, 24(1), 90–91. https://doi.org/10.1137/1024022
MLA 9
Hartmanis, Juris. “Computers and Intractability: A Guide to the Theory of NP-Completeness (Michael R. Garey and David S. Johnson).” SIAM Review, vol. 24, no. 1, 1982, pp. 90–91. https://doi.org/10.1137/1024022.
Chicago
Hartmanis, Juris. 1982. “Computers and Intractability: A Guide to the Theory of NP-Completeness (Michael R. Garey and David S. Johnson).” SIAM Review 24 (1): 90–91. https://doi.org/10.1137/1024022.
Harvard
Hartmanis, J. (1982) ‘Computers and Intractability: A Guide to the Theory of NP-Completeness (Michael R. Garey and David S. Johnson)’, SIAM Review, 24(1), pp. 90–91. doi:10.1137/1024022.
IEEE
J. Hartmanis, “Computers and Intractability: A Guide to the Theory of NP-Completeness (Michael R. Garey and David S. Johnson),” SIAM Review, vol. 24, no. 1, pp. 90–91, 1982, doi: 10.1137/1024022.
BibTeX
@article{hartmanis1982computers,
title = {{Computers and Intractability: A Guide to the Theory of NP-Completeness (Michael R. Garey and David S. Johnson)}},
author = {Hartmanis, Juris},
journal = {SIAM Review},
year = {1982},
volume = {24},
number = {1},
pages = {90--91},
doi = {10.1137/1024022},
url = {https://doi.org/10.1137/1024022}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2017 | 10 | |
| 2018 | 16 | |
| 2019 | 17 | |
| 2020 | 33 | |
| 2021 | 31 | |
| 2022 | 42 | |
| 2023 | 69 | |
| 2024 | 55 | |
| 2025 | 83 | |
| 2026 | 62 |
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- NP-completeness
- computational complexity
- computational intractability
- NP-hard problems
- polynomial-time algorithms
- reduction
- combinatorial optimization
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Hartmanis, J. (1982). Computers and Intractability: A Guide to the Theory of NP-Completeness (Michael R. Garey and David S. Johnson). SIAM Review, 24(1), 90–91. https://doi.org/10.1137/1024022
How many times has this paper been cited?
431 times, according to OpenAlex on 15 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?
Juris Hartmanis.
What is the DOI of this paper?
10.1137/1024022. The permanent link is https://doi.org/10.1137/1024022.
Bibliographic data from OpenAlex (CC0), last checked 15 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.