Book chapter · 2010

NP-Completeness

Oded Goldreich

Cambridge University Press eBooks, 96–141 · Published 16 August 2010 · DOI 10.1017/cbo9780511761355.009

View at the publisherCite this paper

In brief

“NP-Completeness” is a 2010 book chapter by Oded Goldreich, published in Cambridge University Press 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
Authors
1

Abstract

Overview: In light of the difficulty of settling the P-vs-NP Question, when faced with a hard problem H in NP, we cannot expect to prove that H is not in P (unconditionally), because this would imply P ≠ NP. The best we can expect is a conditional proof that H is not in P, based… Read the full abstract at the publisher.

Excerpt. This paper is not open access.

Cite this paper

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

APA 7

Goldreich, O. (2010). NP-Completeness. Cambridge University Press eBooks, 96–141. https://doi.org/10.1017/cbo9780511761355.009

MLA 9

Goldreich, Oded. “NP-Completeness.” Cambridge University Press eBooks, 2010, pp. 96–141. https://doi.org/10.1017/cbo9780511761355.009.

Chicago

Goldreich, Oded. 2010. “NP-Completeness.” Cambridge University Press eBooks: 96–141. https://doi.org/10.1017/cbo9780511761355.009.

Harvard

Goldreich, O. (2010) ‘NP-Completeness’, Cambridge University Press eBooks, pp. 96–141. doi:10.1017/cbo9780511761355.009.

IEEE

O. Goldreich, “NP-Completeness,” Cambridge University Press eBooks, pp. 96–141, 2010, doi: 10.1017/cbo9780511761355.009.

BibTeX

@incollection{goldreich2010completeness,
  title     = {{NP-Completeness}},
  author    = {Goldreich, Oded},
  booktitle = {Cambridge University Press eBooks},
  publisher = {Cambridge University Press},
  year      = {2010},
  pages     = {96--141},
  doi       = {10.1017/cbo9780511761355.009},
  url       = {https://doi.org/10.1017/cbo9780511761355.009}
}

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
  • P versus NP
  • polynomial-time reduction
  • Boolean satisfiability
  • 3-colorability
  • clique problem
  • computational complexity

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?

Goldreich, O. (2010). NP-Completeness. Cambridge University Press eBooks, 96–141. https://doi.org/10.1017/cbo9780511761355.009

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.

Who wrote this paper?

Oded Goldreich.

What is the DOI of this paper?

10.1017/cbo9780511761355.009. The permanent link is https://doi.org/10.1017/cbo9780511761355.009.

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.