Papadimitriou: Computational Complexity
E679896
"Papadimitriou: Computational Complexity" is a widely used graduate-level textbook that systematically develops the theory of computational complexity, including classes like P and NP and the foundations of NP-completeness.
All labels observed (3)
| Label | Occurrences |
|---|---|
| Computational Complexity (textbook) | 1 |
| Papadimitriou: Computational Complexity canonical | 1 |
| textbook "Computational Complexity" | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T7666081 — 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: Papadimitriou: Computational Complexity Context triple: [NP-completeness, centralReference, Papadimitriou: Computational Complexity]
-
A.
P, NP, and NP-Completeness: The Basics of Complexity Theory
"P, NP, and NP-Completeness: The Basics of Complexity Theory" is a foundational textbook by Oded Goldreich that introduces the core concepts, problems, and techniques of computational complexity theory, with a focus on the classes P, NP, and NP-complete problems.
-
B.
Furst–Saxe–Sipser lower bounds
Furst–Saxe–Sipser lower bounds are foundational results in circuit complexity theory that established superpolynomial lower bounds for constant-depth Boolean circuits (AC⁰), demonstrating inherent limitations of such circuits for computing certain functions.
-
C.
Elements of the Theory of Computation
Elements of the Theory of Computation is a foundational textbook that introduces the mathematical and theoretical principles underlying computer science, including automata, formal languages, and computability.
-
D.
“Inapproximability results for SAT and other problems”
“Inapproximability results for SAT and other problems” is a seminal theoretical computer science paper by Johan Håstad that establishes tight hardness-of-approximation bounds for satisfiability and related optimization problems using probabilistically checkable proofs.
-
E.
"Reducibility Among Combinatorial Problems" (1972)
"Reducibility Among Combinatorial Problems" (1972) is a landmark paper by Richard Karp that introduced NP-completeness to a broad audience by showing polynomial-time reductions among 21 classic combinatorial decision problems.
- 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: Papadimitriou: Computational Complexity Target entity description: "Papadimitriou: Computational Complexity" is a widely used graduate-level textbook that systematically develops the theory of computational complexity, including classes like P and NP and the foundations of NP-completeness.
-
A.
P, NP, and NP-Completeness: The Basics of Complexity Theory
"P, NP, and NP-Completeness: The Basics of Complexity Theory" is a foundational textbook by Oded Goldreich that introduces the core concepts, problems, and techniques of computational complexity theory, with a focus on the classes P, NP, and NP-complete problems.
-
B.
Furst–Saxe–Sipser lower bounds
Furst–Saxe–Sipser lower bounds are foundational results in circuit complexity theory that established superpolynomial lower bounds for constant-depth Boolean circuits (AC⁰), demonstrating inherent limitations of such circuits for computing certain functions.
-
C.
Elements of the Theory of Computation
Elements of the Theory of Computation is a foundational textbook that introduces the mathematical and theoretical principles underlying computer science, including automata, formal languages, and computability.
-
D.
“Inapproximability results for SAT and other problems”
“Inapproximability results for SAT and other problems” is a seminal theoretical computer science paper by Johan Håstad that establishes tight hardness-of-approximation bounds for satisfiability and related optimization problems using probabilistically checkable proofs.
-
E.
"Reducibility Among Combinatorial Problems" (1972)
"Reducibility Among Combinatorial Problems" (1972) is a landmark paper by Richard Karp that introduced NP-completeness to a broad audience by showing polynomial-time reductions among 21 classic combinatorial decision problems.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
non-fiction book
ⓘ
textbook ⓘ |
| approach | rigorous mathematical treatment ⓘ |
| audience |
graduate students in computer science
ⓘ
researchers in theoretical computer science ⓘ |
| author | Christos H. Papadimitriou ⓘ |
| emphasizes |
formal definitions of complexity classes
ⓘ
proof techniques in complexity theory ⓘ |
| field |
computational complexity theory
ⓘ
theoretical computer science ⓘ |
| focus |
classification of computational problems by resource usage
ⓘ
foundations of NP-completeness ⓘ
linked to:
NP-completeness
|
| language | English ⓘ |
| level | graduate ⓘ |
| subject |
NP-completeness
ⓘ
P versus NP problem ⓘ alternation ⓘ approximation algorithms and complexity ⓘ circuit complexity ⓘ communication complexity ⓘ complete problems ⓘ complexity classes ⓘ counting complexity classes ⓘ cryptographic complexity assumptions ⓘ hierarchy theorems ⓘ interactive proofs ⓘ logarithmic space complexity ⓘ nondeterministic computation ⓘ parallel complexity ⓘ polynomial hierarchy ⓘ polynomial-time reducibility ⓘ probabilistic computation ⓘ randomized complexity classes ⓘ reductions in complexity theory ⓘ space complexity ⓘ time complexity ⓘ |
| topic |
#P
ⓘ
BPP ⓘ EXP ⓘ L and NL ⓘ NP-complete problems ⓘ PSPACE ⓘ class NP ⓘ class P ⓘ co-NP ⓘ |
| usedAs | course textbook ⓘ |
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: Papadimitriou: Computational Complexity Description of subject: "Papadimitriou: Computational Complexity" is a widely used graduate-level textbook that systematically develops the theory of computational complexity, including classes like P and NP and the foundations of NP-completeness.
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Papadimitriou: Computational Complexity
linked to: Papadimitriou: Computational Complexity