Lance Fortnow
E199753
Lance Fortnow is an American theoretical computer scientist known for his contributions to computational complexity theory and for his expository work on the P vs NP problem.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Lance Fortnow canonical | 8 |
How this entity was disambiguated
This entity first appeared as the object of triple T1778791 — 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: Lance Fortnow Context triple: [Leonard Adleman, notableStudent, Lance Fortnow]
-
A.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
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.
Richard Lipton
Richard Lipton is an American computer scientist known for his influential work in theoretical computer science and cryptography, including contributions to complexity theory and algorithm design.
-
D.
Jeffrey D. Ullman
Jeffrey D. Ullman is a prominent American computer scientist known for his foundational contributions to database theory, algorithms, and formal languages, and for coauthoring several classic textbooks in computer science.
-
E.
Michael Sipser
Michael Sipser is an American theoretical computer scientist known for his influential work in computational complexity theory and for authoring a widely used textbook on the theory of computation.
- 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: Lance Fortnow Target entity description: Lance Fortnow is an American theoretical computer scientist known for his contributions to computational complexity theory and for his expository work on the P vs NP problem.
-
A.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
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.
Richard Lipton
Richard Lipton is an American computer scientist known for his influential work in theoretical computer science and cryptography, including contributions to complexity theory and algorithm design.
-
D.
Jeffrey D. Ullman
Jeffrey D. Ullman is a prominent American computer scientist known for his foundational contributions to database theory, algorithms, and formal languages, and for coauthoring several classic textbooks in computer science.
-
E.
Michael Sipser
Michael Sipser is an American theoretical computer scientist known for his influential work in computational complexity theory and for authoring a widely used textbook on the theory of computation.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
American academic
ⓘ
computer scientist ⓘ person ⓘ theoretical computer scientist ⓘ |
| almaMater |
Cornell University
ⓘ
Massachusetts Institute of Technology ⓘ |
| award |
AAAS Fellow
ⓘ
ACM Fellow ⓘ |
| blogTopic |
computational complexity theory
ⓘ
theoretical computer science ⓘ |
| citizenship |
United States
ⓘ
linked to:
United States of America
|
| coauthor | Bill Gasarch ⓘ |
| degree |
Bachelor's degree from Cornell University
ⓘ
PhD in computer science from Massachusetts Institute of Technology ⓘ |
| doctoralAdvisor | Michael Sipser ⓘ |
| editorialRole |
editor-in-chief of the ACM Transactions on Computation Theory
ⓘ
former editor of the Complexity Theory Column of SIGACT News ⓘ |
| employer |
Georgia Institute of Technology
ⓘ
Illinois Institute of Technology ⓘ |
| field |
computational complexity theory
ⓘ
theoretical computer science ⓘ |
| genre | popular science writing ⓘ |
| hasBlog | Computational Complexity blog ⓘ |
| knownFor |
computational complexity theory
ⓘ
expository work on the P versus NP problem ⓘ popularizing the P versus NP problem ⓘ research on interactive proof systems ⓘ research on relativization in complexity theory ⓘ |
| language | English ⓘ |
| nationality |
United States
ⓘ
linked to:
United States of America
|
| notableConcept | relativization barriers in complexity theory ⓘ |
| notableWork | The Golden Ticket: P, NP, and the Search for the Impossible ⓘ |
| occupation |
author
ⓘ
department chair ⓘ professor ⓘ |
| position |
Dean of the College of Computing at Illinois Institute of Technology
ⓘ
Professor at Georgia Institute of Technology ⓘ |
| professionalMembership |
Association for Computing Machinery
ⓘ
IEEE Computer Society ⓘ |
| researchArea |
P versus NP problem
ⓘ
complexity theory and randomness ⓘ interactive proofs ⓘ relativization ⓘ |
| teachingArea |
computational complexity
ⓘ
theory of computation ⓘ |
| writesAbout |
implications of P versus NP for society
ⓘ
limits of efficient 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: Lance Fortnow Description of subject: Lance Fortnow is an American theoretical computer scientist known for his contributions to computational complexity theory and for his expository work on the P vs NP problem.
Referenced by (8)
Full triples — surface form annotated when it differs from this entity's canonical label.