P, NP, and NP-Completeness: The Basics of Complexity Theory
E123824
"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.
All labels observed (1)
| Label | Occurrences |
|---|---|
| P, NP, and NP-Completeness: The Basics of Complexity Theory canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T1013317 — 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: P, NP, and NP-Completeness: The Basics of Complexity Theory Context triple: [Oded Goldreich, authorOf, P, NP, and NP-Completeness: The Basics of Complexity Theory]
-
A.
Computational Complexity: A Conceptual Perspective
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.
-
B.
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.
-
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.
Interactive Proofs and the Hardness of Approximating Cliques
"Interactive Proofs and the Hardness of Approximating Cliques" is a seminal theoretical computer science paper that introduced powerful interactive proof techniques to show that finding near-maximum cliques in graphs is computationally intractable to approximate within strong bounds.
-
E.
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.
- 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: P, NP, and NP-Completeness: The Basics of Complexity Theory Target entity description: "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.
-
A.
Computational Complexity: A Conceptual Perspective
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.
-
B.
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.
-
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.
Interactive Proofs and the Hardness of Approximating Cliques
"Interactive Proofs and the Hardness of Approximating Cliques" is a seminal theoretical computer science paper that introduced powerful interactive proof techniques to show that finding near-maximum cliques in graphs is computationally intractable to approximate within strong bounds.
-
E.
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.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
complexity theory textbook
ⓘ
computer science book ⓘ non-fiction book ⓘ textbook ⓘ |
| author | Oded Goldreich ⓘ |
| coversConcept |
combinatorial problems
ⓘ
complete problems for NP ⓘ complexity-theoretic proof techniques ⓘ decision vs search problems ⓘ formal problem reductions ⓘ nondeterministic Turing machines ⓘ time complexity ⓘ |
| educationalObjective |
develop formal reasoning about efficiency
ⓘ
introduce basics of computational complexity ⓘ |
| emphasis |
clarity of definitions
ⓘ
foundational understanding over breadth ⓘ rigorous proofs ⓘ |
| field |
computational complexity theory
ⓘ
theoretical computer science ⓘ |
| focus |
core concepts of complexity theory
ⓘ
formal definitions of complexity classes ⓘ mathematical rigor in complexity theory ⓘ techniques for proving NP-completeness ⓘ |
| genre | academic textbook ⓘ |
| hasPerspective | theoretical and rigorous ⓘ |
| intendedAudience |
advanced undergraduates
ⓘ
graduate students ⓘ researchers in theoretical computer science ⓘ |
| language | English ⓘ |
| mainTopic |
Cook–Levin theorem
ⓘ
NP-complete problems ⓘ NP-hardness ⓘ P versus NP problem ⓘ SAT problem ⓘ completeness notions in complexity ⓘ complexity class NP ⓘ complexity class P ⓘ computational complexity ⓘ decision problems ⓘ polynomial-time algorithms ⓘ polynomial-time reductions ⓘ reductions in complexity theory ⓘ |
| relatedAuthor | Oded Goldreich ⓘ |
| relatedWork | Computational Complexity: A Conceptual Perspective ⓘ |
| usedIn |
courses on computational complexity
ⓘ
courses on theory of computation ⓘ |
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: P, NP, and NP-Completeness: The Basics of Complexity Theory Description of subject: "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.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.