Book chapter · 2005
The Theory of NP-Completeness
Springer eBooks, 63–75 · Published 13 July 2005 · DOI 10.1007/3-540-27477-4_5
In brief
“The Theory of NP-Completeness” is a 2005 book chapter, published in Springer eBooks. OpenAlex counts 4 citations as of 15 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 4
- Most cited in
- 2012 (1)
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
The Theory of NP-Completeness. (2005). Springer eBooks, 63–75. https://doi.org/10.1007/3-540-27477-4_5
MLA 9
“The Theory of NP-Completeness.” Springer eBooks, 2005, pp. 63–75. https://doi.org/10.1007/3-540-27477-4_5.
Chicago
2005. “The Theory of NP-Completeness.” Springer eBooks: 63–75. https://doi.org/10.1007/3-540-27477-4_5.
Harvard
(2005) ‘The Theory of NP-Completeness’, Springer eBooks, pp. 63–75. doi:10.1007/3-540-27477-4_5.
IEEE
“The Theory of NP-Completeness,” Springer eBooks, pp. 63–75, 2005, doi: 10.1007/3-540-27477-4_5.
BibTeX
@incollection{anon2005theory,
title = {{The Theory of NP-Completeness}},
booktitle = {Springer eBooks},
publisher = {Springer Nature},
year = {2005},
pages = {63--75},
doi = {10.1007/3-540-27477-4_5},
url = {https://doi.org/10.1007/3-540-27477-4_5}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- NP-completeness
- computational complexity
- NP-hard problems
- polynomial-time reduction
- decision problems
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?
The Theory of NP-Completeness. (2005). Springer eBooks, 63–75. https://doi.org/10.1007/3-540-27477-4_5
How many times has this paper been cited?
4 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.
What is the DOI of this paper?
10.1007/3-540-27477-4_5. The permanent link is https://doi.org/10.1007/3-540-27477-4_5.
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.