Complexity of Computer Computations
E1466552
UNEXPLORED
"Complexity of Computer Computations" is a seminal 1972 conference proceedings volume that helped establish the foundations of computational complexity theory by collecting influential early papers on algorithmic efficiency and problem hardness.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Complexity of Computer Computations canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T21088225 — 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: Complexity of Computer Computations Context triple: [Reducibility Among Combinatorial Problems, publishedIn, Complexity of Computer Computations]
-
A.
"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.
-
B.
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.
-
C.
Papadimitriou: Computational Complexity
"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.
-
D.
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.
-
E.
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.
- 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: Complexity of Computer Computations Target entity description: "Complexity of Computer Computations" is a seminal 1972 conference proceedings volume that helped establish the foundations of computational complexity theory by collecting influential early papers on algorithmic efficiency and problem hardness.
-
A.
"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.
-
B.
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.
-
C.
Papadimitriou: Computational Complexity
"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.
-
D.
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.
-
E.
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.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject linked to:
"Reducibility Among Combinatorial Problems" (1972)