Book chapter · 2005

NP-Completeness

Springer eBooks, 343–375 · Published 25 December 2005 · DOI 10.1007/3-540-29297-7_15

View at the publisherCite this paper

In brief

“NP-Completeness” is a 2005 book chapter, published in Springer eBooks. OpenAlex counts 0 citations as of 15 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
0
References
21

Cite this paper

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

APA 7

NP-Completeness. (2005). Springer eBooks, 343–375. https://doi.org/10.1007/3-540-29297-7_15

MLA 9

“NP-Completeness.” Springer eBooks, 2005, pp. 343–375. https://doi.org/10.1007/3-540-29297-7_15.

Chicago

2005. “NP-Completeness.” Springer eBooks: 343–375. https://doi.org/10.1007/3-540-29297-7_15.

Harvard

(2005) ‘NP-Completeness’, Springer eBooks, pp. 343–375. doi:10.1007/3-540-29297-7_15.

IEEE

“NP-Completeness,” Springer eBooks, pp. 343–375, 2005, doi: 10.1007/3-540-29297-7_15.

BibTeX

@incollection{anon2005completeness,
  title     = {{NP-Completeness}},
  booktitle = {Springer eBooks},
  publisher = {Springer Nature},
  year      = {2005},
  pages     = {343--375},
  doi       = {10.1007/3-540-29297-7_15},
  url       = {https://doi.org/10.1007/3-540-29297-7_15}
}

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

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

NP-Completeness. (2005). Springer eBooks, 343–375. https://doi.org/10.1007/3-540-29297-7_15

How many times has this paper been cited?

0 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-29297-7_15. The permanent link is https://doi.org/10.1007/3-540-29297-7_15.

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.