Bill Gasarch
E735010
Bill Gasarch is a theoretical computer scientist and mathematician known for his work in computational complexity, combinatorics, and his widely read expository writing and blogging on complexity theory.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Bill Gasarch canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T8449040 — 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: Bill Gasarch Context triple: [Lance Fortnow, coauthor, Bill Gasarch]
-
A.
Lance Fortnow
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.
-
B.
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.
-
C.
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.
-
D.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
E.
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.
- 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: Bill Gasarch Target entity description: Bill Gasarch is a theoretical computer scientist and mathematician known for his work in computational complexity, combinatorics, and his widely read expository writing and blogging on complexity theory.
-
A.
Lance Fortnow
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.
-
B.
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.
-
C.
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.
-
D.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
E.
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.
- F. None of above. chosen
Statements (30)
| Predicate | Object |
|---|---|
| instanceOf |
mathematician
ⓘ
person ⓘ theoretical computer scientist ⓘ |
| academicDiscipline |
computer science
ⓘ
mathematics ⓘ |
| countryOfCitizenship | United States of America ⓘ |
| employer | University of Maryland, College Park NERFINISHED ⓘ |
| fieldOfWork |
combinatorics
ⓘ
computational complexity theory ⓘ mathematics ⓘ theoretical computer science ⓘ |
| hasFamilyName | Gasarch NERFINISHED ⓘ |
| hasGivenName | Bill NERFINISHED ⓘ |
| knownFor |
blogging on complexity theory
ⓘ
expository writing on computational complexity ⓘ surveys in computational complexity ⓘ work on the P versus NP problem expository literature ⓘ |
| languageOfWorkOrName | English ⓘ |
| notableFor |
popular surveys on major open problems in complexity
ⓘ
widely read expository blog posts in complexity theory ⓘ |
| occupation | professor ⓘ |
| researchInterest |
combinatorics
ⓘ
computational complexity ⓘ theory of computation ⓘ |
| workLocation | College Park, Maryland NERFINISHED ⓘ |
| writesAbout |
P versus NP problem
NERFINISHED
ⓘ
combinatorics ⓘ complexity theory ⓘ theoretical computer science ⓘ |
| writesBlog | blog on computational complexity ⓘ |
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: Bill Gasarch Description of subject: Bill Gasarch is a theoretical computer scientist and mathematician known for his work in computational complexity, combinatorics, and his widely read expository writing and blogging on complexity theory.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.