Stephen A. Cook
E1045586
Stephen A. Cook is a Canadian-American computer scientist best known for founding the theory of NP-completeness and making seminal contributions to computational complexity theory.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Stephen A. Cook canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T13507007 — 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: Stephen A. Cook Context triple: [The Complexity of Theorem-Proving Procedures, author, Stephen A. Cook]
-
A.
Richard Karp
Richard Karp is a renowned American computer scientist best known for his foundational work in computational complexity theory and combinatorial algorithms, including the theory of NP-completeness.
-
B.
Manuel Blum
Manuel Blum is a Venezuelan-American computer scientist and Turing Award laureate renowned for his foundational contributions to computational complexity theory and cryptography.
-
C.
Juris Hartmanis
Juris Hartmanis was a pioneering computer scientist best known for co-founding the field of computational complexity theory and sharing the 1993 Turing Award for his fundamental contributions.
-
D.
John E. Hopcroft
John E. Hopcroft is an American computer scientist renowned for his foundational contributions to algorithms and automata theory and as a coauthor of the classic textbook "Introduction to Automata Theory, Languages, and Computation."
-
E.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
- 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: Stephen A. Cook Target entity description: Stephen A. Cook is a Canadian-American computer scientist best known for founding the theory of NP-completeness and making seminal contributions to computational complexity theory.
-
A.
Richard Karp
Richard Karp is a renowned American computer scientist best known for his foundational work in computational complexity theory and combinatorial algorithms, including the theory of NP-completeness.
-
B.
Manuel Blum
Manuel Blum is a Venezuelan-American computer scientist and Turing Award laureate renowned for his foundational contributions to computational complexity theory and cryptography.
-
C.
Juris Hartmanis
Juris Hartmanis was a pioneering computer scientist best known for co-founding the field of computational complexity theory and sharing the 1993 Turing Award for his fundamental contributions.
-
D.
John E. Hopcroft
John E. Hopcroft is an American computer scientist renowned for his foundational contributions to algorithms and automata theory and as a coauthor of the classic textbook "Introduction to Automata Theory, Languages, and Computation."
-
E.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
- F. None of above. chosen
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
computer scientist
ⓘ
human ⓘ mathematician ⓘ theoretical computer scientist ⓘ university teacher ⓘ |
| academicDegree |
Bachelor of Science
ⓘ
Doctor of Philosophy ⓘ Master of Science ⓘ |
| awardReceived |
EATCS Award
NERFINISHED
ⓘ
Gerhard Herzberg Canada Gold Medal for Science and Engineering NERFINISHED ⓘ Jeffery–Williams Prize NERFINISHED ⓘ John L. Synge Award NERFINISHED ⓘ Order of Canada ⓘ Turing Award ⓘ |
| birthPlace | Buffalo, New York NERFINISHED ⓘ |
| citizenship |
American
ⓘ
Canadian ⓘ |
| countryOfCitizenship |
Canada
ⓘ
United States of America ⓘ |
| dateOfBirth | 1939-12-14 ⓘ |
| doctoralThesis | The Complexity of Theorem-Proving Procedures NERFINISHED ⓘ |
| doctoralThesisYear | 1966 ⓘ |
| educatedAt |
Harvard University
ⓘ
University of Michigan ⓘ |
| employer | University of Toronto NERFINISHED ⓘ |
| familyName | Cook NERFINISHED ⓘ |
| fieldOfWork |
computational complexity theory
ⓘ
computer science ⓘ mathematical logic ⓘ theoretical computer science ⓘ |
| givenName | Stephen NERFINISHED ⓘ |
| hasAcademicAdvisor | Wang Hao NERFINISHED ⓘ |
| influenced |
complexity theory research
ⓘ
theory of algorithms ⓘ |
| knownFor |
Cook–Levin theorem
NERFINISHED
ⓘ
P versus NP problem NERFINISHED ⓘ contributions to computational complexity theory ⓘ founding the theory of NP-completeness ⓘ work on satisfiability problem ⓘ |
| languageOfWorkOrName | English ⓘ |
| memberOf |
American Academy of Arts and Sciences
ⓘ
National Academy of Sciences ⓘ Royal Society of Canada NERFINISHED ⓘ |
| notableStudent |
Juris Hartmanis
NERFINISHED
ⓘ
Moshe Y. Vardi NERFINISHED ⓘ |
| notableWork | The Complexity of Theorem-Proving Procedures NERFINISHED ⓘ |
| positionHeld | professor ⓘ |
| sexOrGender | male ⓘ |
| workLocation | Toronto NERFINISHED ⓘ |
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: Stephen A. Cook Description of subject: Stephen A. Cook is a Canadian-American computer scientist best known for founding the theory of NP-completeness and making seminal contributions to computational complexity theory.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
The Complexity of Theorem-Proving Procedures