Book chapter · 2006

Complexity Theory and NP-Completeness

Springer eBooks, 345–367 · Published 9 September 2006 · DOI 10.1007/0-387-32520-4_19

View at the publisherCite this paper

In brief

“Complexity Theory and NP-Completeness” is a 2006 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

Cite this paper

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

APA 7

Complexity Theory and NP-Completeness. (2006). Springer eBooks, 345–367. https://doi.org/10.1007/0-387-32520-4_19

MLA 9

“Complexity Theory and NP-Completeness.” Springer eBooks, 2006, pp. 345–367. https://doi.org/10.1007/0-387-32520-4_19.

Chicago

2006. “Complexity Theory and NP-Completeness.” Springer eBooks: 345–367. https://doi.org/10.1007/0-387-32520-4_19.

Harvard

(2006) ‘Complexity Theory and NP-Completeness’, Springer eBooks, pp. 345–367. doi:10.1007/0-387-32520-4_19.

IEEE

“Complexity Theory and NP-Completeness,” Springer eBooks, pp. 345–367, 2006, doi: 10.1007/0-387-32520-4_19.

BibTeX

@incollection{anon2006complexity,
  title     = {{Complexity Theory and NP-Completeness}},
  booktitle = {Springer eBooks},
  publisher = {Springer Nature},
  year      = {2006},
  pages     = {345--367},
  doi       = {10.1007/0-387-32520-4_19},
  url       = {https://doi.org/10.1007/0-387-32520-4_19}
}

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

  • computational complexity theory
  • NP-completeness
  • NP-hard problems
  • polynomial-time reduction

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?

Complexity Theory and NP-Completeness. (2006). Springer eBooks, 345–367. https://doi.org/10.1007/0-387-32520-4_19

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/0-387-32520-4_19. The permanent link is https://doi.org/10.1007/0-387-32520-4_19.

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.