The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Computational complexity: a conceptual perspective
Abstract
This book is rooted in the thesis that complexity theory is extremely rich in conceptual content, and that this contents should be explicitly communicated in expositions and courses on the subject. The desire to provide a corresponding textbook is indeed the motivation for writing the current book and its main governing principle.The book offers a conceptual perspective on complexity theory, and the presentation is designed to highlight this perspective. It is intended mainly for students that wish to learn complexity theory and for educators that intend to teach a course on complexity theory. The book is also intended to promote interest in complexity theory and make it acccessible to general readers with adequate background (which is mainly being comfortable with abstract discussions, definitions and proofs). We expect most readers to have a basic knowledge of algorithms, or at least be fairly comfortable with the notion of an algorithm.The book focuses on several sub-areas of complexity theory (including, e.g., pseudorandomness and probabilistic proof systems). In each case, the exposition starts from the intuitive questions addresses by the sub-area, as embodied in the concepts that it studies. The exposition discusses the fundamental importance of these questions, the choices made in the actual formulation of these questions and notions, the approaches that underly the answers, and the ideas that are embedded in these answers. Our view is that these (\non-technical) aspects are the core of the field, and the presentation attempts to re ect this view.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Copeland, J. (2007) · NeuroQuantology · doi:10.14704/nq.2004.2.2.40 · Cited by 139
Flajolet, P., & Szpankowski, W. (2000) · Random Structures and Algorithms · doi:10.1002/(sici)1098-2418(199701)10:1/2<1::aid-rsa1>3.0.co;2-4 · Cited by 86
Baggen, S. (1997) · Cited by 75
The challenge of artificial intelligence
Reddy, R. (1996) · Computer · doi:10.1109/2.539726 · Cited by 44
Ganley, M. J. (2006) · Information Security Technical Report · doi:10.1016/j.istr.2006.03.005 · Cited by 18
Cited by
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
Undirected connectivity in log-space
Reingold, O. (2008) · Journal of the ACM · doi:10.1145/1391289.1391291 · Cited by 505
Nature-inspired optimization algorithms: Challenges and open problems
Yang, X.-S. (2020) · Journal of Computational Science · doi:10.1016/j.jocs.2020.101104 · Cited by 429
Witness encryption and its applications
Garg, S., Gentry, C., Sahai, A., & Waters, B. (2013) · Proceedings of the forty-fifth annual ACM symposium on Theory of Computing · doi:10.1145/2488608.2488667 · Cited by 333
Introduction to Property Testing
Goldreich, O. (2017) · Cambridge University Press eBooks · doi:10.1017/9781108135252 · Cited by 270
Metadata
- Venue
- Choice Reviews Online
- Publisher
- American Library Association
- Published
- 2008-10-01
- Volume
- 46
- Issue
- 02
- Pages
- 46-0942-46-0942
- ISSN
- 0009-4978 (ISSN-L)
- 1523-8253
- OpenAlex
- W2006252547
- Cited by
- 421
- References
- 5
- Type
- book review
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Computational complexity: a conceptual perspective. https://app.cochat.ai/papers/10.5860/choice.46-0942
- The paper
- Computational complexity: a conceptual perspective. (2008). Choice Reviews Online. https://doi.org/10.5860/choice.46-0942
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.