Computational Complexity: A Conceptual Perspective
E122536
Computational Complexity: A Conceptual Perspective is a graduate-level textbook that presents the foundations and key themes of computational complexity theory with an emphasis on conceptual understanding over technical detail.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Computational Complexity: A Conceptual Perspective canonical | 2 |
| Computational Complexity (book) | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T1013315 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Computational Complexity: A Conceptual Perspective Context triple: [Oded Goldreich, authorOf, Computational Complexity: A Conceptual Perspective]
-
A.
Blum complexity measures
Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
-
B.
Randomness and Computation
"Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
-
C.
Introduction to the Theory of Computation
Introduction to the Theory of Computation is a widely used textbook in theoretical computer science that covers formal languages, automata, computability, and complexity theory.
-
D.
The Knowledge Complexity of Interactive Proof Systems
"The Knowledge Complexity of Interactive Proof Systems" is a seminal theoretical computer science paper that introduced the notion of zero-knowledge proofs, fundamentally shaping modern cryptography and complexity theory.
-
E.
PCP theorem
The PCP theorem is a fundamental result in computational complexity theory stating that every problem in NP has probabilistically checkable proofs that can be verified by examining only a constant number of bits, with major implications for the hardness of approximation.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Computational Complexity: A Conceptual Perspective Target entity description: Computational Complexity: A Conceptual Perspective is a graduate-level textbook that presents the foundations and key themes of computational complexity theory with an emphasis on conceptual understanding over technical detail.
-
A.
Blum complexity measures
Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
-
B.
Randomness and Computation
"Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
-
C.
Introduction to the Theory of Computation
Introduction to the Theory of Computation is a widely used textbook in theoretical computer science that covers formal languages, automata, computability, and complexity theory.
-
D.
The Knowledge Complexity of Interactive Proof Systems
"The Knowledge Complexity of Interactive Proof Systems" is a seminal theoretical computer science paper that introduced the notion of zero-knowledge proofs, fundamentally shaping modern cryptography and complexity theory.
-
E.
PCP theorem
The PCP theorem is a fundamental result in computational complexity theory stating that every problem in NP has probabilistically checkable proofs that can be verified by examining only a constant number of bits, with major implications for the hardness of approximation.
- F. None of above. chosen
Statements (32)
| Predicate | Object |
|---|---|
| instanceOf |
computer science book
ⓘ
graduate-level textbook ⓘ non-fiction book ⓘ textbook ⓘ |
| approach |
focus on ideas over technical details
ⓘ
unified conceptual framework for complexity theory ⓘ |
| author | Oded Goldreich ⓘ |
| emphasis |
conceptual understanding
ⓘ
foundations of computational complexity ⓘ key themes of complexity theory ⓘ |
| field |
computational complexity theory
ⓘ
theoretical computer science ⓘ |
| language | English ⓘ |
| publisher | Cambridge University Press ⓘ |
| targetAudience |
graduate students
ⓘ
researchers in theoretical computer science ⓘ |
| topic |
NP-completeness
ⓘ
circuit complexity ⓘ complexity classes ⓘ derandomization ⓘ hardness of approximation ⓘ hierarchy theorems ⓘ interactive proofs ⓘ lower bounds in complexity theory ⓘ probabilistically checkable proofs ⓘ pseudorandomness ⓘ randomized computation ⓘ reductions ⓘ space complexity ⓘ time complexity ⓘ |
| usedIn |
graduate courses in computational complexity
ⓘ
self-study by theoretical computer scientists ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Computational Complexity: A Conceptual Perspective Description of subject: Computational Complexity: A Conceptual Perspective is a graduate-level textbook that presents the foundations and key themes of computational complexity theory with an emphasis on conceptual understanding over technical detail.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Computational Complexity: A Conceptual Perspective
P, NP, and NP-Completeness: The Basics of Complexity Theory
→
relatedWork
→
Computational Complexity: A Conceptual Perspective
ⓘ