↓ Skip to main content
Altmetric
What is this page?
Embed badge
Share
Share on Twitter
Share on Facebook
Share by email
Complexity Theory: Exploring the Limits of Efficient Algorithms
Overview of attention for book
Table of Contents
Altmetric Badge
Book Overview
Altmetric Badge
Chapter 1
Introduction
Altmetric Badge
Chapter 2
Algorithmic Problems & Their Complexity
Altmetric Badge
Chapter 3
Fundamental Complexity Classes
Altmetric Badge
Chapter 4
Reductions — Algorithmic Relationships Between Problems
Altmetric Badge
Chapter 5
The Theory of NP-Completeness
Altmetric Badge
Chapter 6
NP-complete and NP-equivalent Problems
Altmetric Badge
Chapter 7
The Complexity Analysis of Problems
Altmetric Badge
Chapter 8
The Complexity of Approximation Problems — Classical Results
Altmetric Badge
Chapter 9
The Complexity of Black Box Problems
Altmetric Badge
Chapter 10
Additional Complexity Classes and Relationships Between Complexity Classes
Altmetric Badge
Chapter 11
Interactive Proofs
Altmetric Badge
Chapter 12
The PCP Theorem and the Complexity of Approximation Problems
Altmetric Badge
Chapter 13
Further Topics From Classical Complexity Theory
Altmetric Badge
Chapter 14
The Complexity of Non-uniform Problems
Altmetric Badge
Chapter 15
Communication Complexity
Altmetric Badge
Chapter 16
The Complexity of Boolean Functions
Overall attention for this book and its chapters
Altmetric Badge
Mentioned by
syllabi
1
institution with syllabi
wikipedia
31
Wikipedia pages
q&a
1
Q&A thread
Citations
dimensions_citation
53
Dimensions
Readers on
mendeley
73
Mendeley
Book overview
1. Introduction
2. Algorithmic Problems & Their Complexity
3. Fundamental Complexity Classes
4. Reductions — Algorithmic Relationships Between Problems
5. The Theory of NP-Completeness
6. NP-complete and NP-equivalent Problems
7. The Complexity Analysis of Problems
8. The Complexity of Approximation Problems — Classical Results
9. The Complexity of Black Box Problems
10. Additional Complexity Classes and Relationships Between Complexity Classes
11. Interactive Proofs
12. The PCP Theorem and the Complexity of Approximation Problems
13. Further Topics From Classical Complexity Theory
14. The Complexity of Non-uniform Problems
15. Communication Complexity
16. The Complexity of Boolean Functions
Summary
Syllabi
Wikipedia
Q&A
Dimensions citations
This data is correct as of December 2015 - for more up to date information, please visit
https://opensyllabus.org/
So far, Altmetric has seen this research output assigned in
2
syllabi from
1
institutions on Open Syllabus Project.
Institution
Syllabi count
Course subject areas covered
Cornell University
2
Unknown