On the Computational Complexity of Algorithms
E1480977
UNEXPLORED
"On the Computational Complexity of Algorithms" is a foundational research paper that helped establish the formal study of computational complexity by analyzing the resource requirements of algorithms.
All labels observed (1)
| Label | Occurrences |
|---|---|
| On the Computational Complexity of Algorithms canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T21377439 — 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: On the Computational Complexity of Algorithms Context triple: [Richard E. Stearns, notableWork, On the Computational Complexity of Algorithms]
-
A.
Complexity of Computer Computations
"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.
-
B.
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.
-
C.
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.
-
D.
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms is a classic computer science textbook that systematically presents fundamental techniques and theoretical foundations for designing and analyzing efficient algorithms.
-
E.
The Computational Complexity of Boolean Functions
"The Computational Complexity of Boolean Functions" is a foundational monograph in theoretical computer science that systematically studies the resources required to compute Boolean functions, particularly within circuit complexity.
- 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: On the Computational Complexity of Algorithms Target entity description: "On the Computational Complexity of Algorithms" is a foundational research paper that helped establish the formal study of computational complexity by analyzing the resource requirements of algorithms.
-
A.
Complexity of Computer Computations
"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.
-
B.
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.
-
C.
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.
-
D.
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms is a classic computer science textbook that systematically presents fundamental techniques and theoretical foundations for designing and analyzing efficient algorithms.
-
E.
The Computational Complexity of Boolean Functions
"The Computational Complexity of Boolean Functions" is a foundational monograph in theoretical computer science that systematically studies the resources required to compute Boolean functions, particularly within circuit complexity.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.