Book · 2010

P, NP, and NP-Completeness: The Basics of Computational Complexity

Oded Goldreich

Cambridge University Press · Published 16 August 2010 · DOI 10.1017/cbo9780511761355

View at the publisherCite this paper

In brief

“P, NP, and NP-Completeness: The Basics of Computational Complexity” is a 2010 book by Oded Goldreich. OpenAlex counts 69 citations as of 15 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
69
Most cited in
2021 (9)
Field-weighted impact
0.58
Authors
1

Abstract

The focus of this book is the P versus NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P versus NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs… 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). P, NP, and NP-Completeness: The Basics of Computational Complexity. Cambridge University Press. https://doi.org/10.1017/cbo9780511761355

MLA 9

Goldreich, Oded. P, NP, and NP-Completeness: The Basics of Computational Complexity. Cambridge University Press, 2010. https://doi.org/10.1017/cbo9780511761355.

Chicago

Goldreich, Oded. 2010. P, NP, and NP-Completeness: The Basics of Computational Complexity. Cambridge University Press. https://doi.org/10.1017/cbo9780511761355.

Harvard

Goldreich, O. (2010) P, NP, and NP-Completeness: The Basics of Computational Complexity. Cambridge University Press. doi:10.1017/cbo9780511761355.

IEEE

O. Goldreich, P, NP, and NP-Completeness: The Basics of Computational Complexity. Cambridge University Press, 2010, doi: 10.1017/cbo9780511761355.

BibTeX

@book{goldreich2010completeness,
  title     = {{P, NP, and NP-Completeness: The Basics of Computational Complexity}},
  author    = {Goldreich, Oded},
  publisher = {Cambridge University Press},
  year      = {2010},
  doi       = {10.1017/cbo9780511761355},
  url       = {https://doi.org/10.1017/cbo9780511761355}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
201711
201822
201933
202033
202199
202277
202388
202488
202588
202644

Its field-weighted citation impact is 0.58: it has been cited 0.58 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs

  • NP-completeness
  • computational complexity
  • computational intractability
  • computational model
  • NP-complete problems
  • complexity classes

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). P, NP, and NP-Completeness: The Basics of Computational Complexity. Cambridge University Press. https://doi.org/10.1017/cbo9780511761355

How many times has this paper been cited?

69 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. The permanent link is https://doi.org/10.1017/cbo9780511761355.

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.