Book chapter · 2010
Overview
Cambridge University Press eBooks, xvii–xx · Published 16 August 2010 · DOI 10.1017/cbo9780511761355.002
In brief
“Overview” 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
This book starts by providing the relevant background on computability theory , which is the setting in which Complexity theoretic questions are being studied. Most importantly, this preliminary chapter (i.e., Chapter 1) provides a treatment of central notions, such as search and decision problems, algorithms that solve such problems, and their complexity. Special attention is… 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). Overview. Cambridge University Press eBooks, xvii–xx. https://doi.org/10.1017/cbo9780511761355.002
MLA 9
Goldreich, Oded. “Overview.” Cambridge University Press eBooks, 2010, pp. xvii–xx. https://doi.org/10.1017/cbo9780511761355.002.
Chicago
Goldreich, Oded. 2010. “Overview.” Cambridge University Press eBooks: xvii–xx. https://doi.org/10.1017/cbo9780511761355.002.
Harvard
Goldreich, O. (2010) ‘Overview’, Cambridge University Press eBooks, pp. xvii–xx. doi:10.1017/cbo9780511761355.002.
IEEE
O. Goldreich, “Overview,” Cambridge University Press eBooks, pp. xvii–xx, 2010, doi: 10.1017/cbo9780511761355.002.
BibTeX
@incollection{goldreich2010overview,
title = {{Overview}},
author = {Goldreich, Oded},
booktitle = {Cambridge University Press eBooks},
publisher = {Cambridge University Press},
year = {2010},
pages = {xvii--xx},
doi = {10.1017/cbo9780511761355.002},
url = {https://doi.org/10.1017/cbo9780511761355.002}
}
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
- P versus NP
- NP-completeness
- computability theory
- search problems
- decision problems
- coNP
- promise problems
- optimal search algorithms
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?
Goldreich, O. (2010). Overview. Cambridge University Press eBooks, xvii–xx. https://doi.org/10.1017/cbo9780511761355.002
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.002. The permanent link is https://doi.org/10.1017/cbo9780511761355.002.
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.