Johan Håstad
E22525
Johan Håstad is a Swedish theoretical computer scientist renowned for his groundbreaking work in computational complexity theory, particularly optimal inapproximability results and contributions to the PCP theorem.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Johan Håstad canonical | 5 |
How this entity was disambiguated
This entity first appeared as the object of triple T143819 — 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: Johan Håstad Context triple: [Shafi Goldwasser, coAuthor, Johan Håstad]
-
A.
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.
-
B.
Oded Goldreich
Oded Goldreich is an Israeli computer scientist renowned for his foundational contributions to cryptography, computational complexity, and the theory of pseudorandomness.
-
C.
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.
-
D.
Silvio Micali
Silvio Micali is an Italian computer scientist renowned for his foundational contributions to cryptography, zero-knowledge proofs, and secure protocols.
-
E.
Shafi Goldwasser
Shafi Goldwasser is an Israeli-American computer scientist renowned for her foundational contributions to cryptography and computational complexity theory.
- 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: Johan Håstad Target entity description: Johan Håstad is a Swedish theoretical computer scientist renowned for his groundbreaking work in computational complexity theory, particularly optimal inapproximability results and contributions to the PCP theorem.
-
A.
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.
-
B.
Oded Goldreich
Oded Goldreich is an Israeli computer scientist renowned for his foundational contributions to cryptography, computational complexity, and the theory of pseudorandomness.
-
C.
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.
-
D.
Silvio Micali
Silvio Micali is an Italian computer scientist renowned for his foundational contributions to cryptography, zero-knowledge proofs, and secure protocols.
-
E.
Shafi Goldwasser
Shafi Goldwasser is an Israeli-American computer scientist renowned for her foundational contributions to cryptography and computational complexity theory.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
computer scientist
ⓘ
human ⓘ mathematician ⓘ theoretical computer scientist ⓘ |
| academicDegree | PhD in computer science ⓘ |
| affiliation |
KTH Royal Institute of Technology
ⓘ
surface form:
School of Computer Science and Communication at KTH
|
| awardReceived |
Paris Kanellakis Theory and Practice Award
ⓘ
surface form:
ACM Paris Kanellakis Theory and Practice Award
Gödel Prize ⓘ
surface form:
ACM SIGACT Gödel Prize
Gödel Prize ⓘ Gödel Prize ⓘ
surface form:
Gödel Prize 1994
Gödel Prize 2011 ⓘ Royal Swedish Academy of Engineering Sciences ⓘ
surface form:
Royal Swedish Academy of Engineering Sciences Gold Medal
Crafoord Prize ⓘ
surface form:
Royal Swedish Academy of Sciences prize in mathematics
|
| citizenship | Sweden ⓘ |
| countryOfCitizenship | Sweden ⓘ |
| doctoralAdvisor | Jeffrey D. Ullman ⓘ |
| educatedAt |
KTH Royal Institute of Technology
ⓘ
Massachusetts Institute of Technology ⓘ |
| employer | KTH Royal Institute of Technology ⓘ |
| fieldOfWork |
approximation algorithms
ⓘ
computational complexity theory ⓘ probabilistically checkable proofs ⓘ theoretical computer science ⓘ |
| gender | male ⓘ |
| influenced |
development of PCP-based inapproximability
ⓘ
research on hardness of approximation ⓘ |
| knownFor |
Håstad’s switching lemma
ⓘ
PCP theorem ⓘ hardness of approximation for Max-Cut ⓘ hardness of approximation for Max-E3-SAT ⓘ hardness of approximation for set cover ⓘ hardness of approximation for vertex cover ⓘ optimal inapproximability results ⓘ results on bounded-depth Boolean circuits ⓘ results on small-depth circuits ⓘ |
| memberOf |
Royal Swedish Academy of Engineering Sciences
ⓘ
Royal Swedish Academy of Sciences ⓘ |
| nativeLanguage | Swedish ⓘ |
| notableConcept |
Håstad’s optimal inapproximability bounds
ⓘ
Håstad’s switching lemma ⓘ |
| notableWork |
“Almost optimal lower bounds for small depth circuits”
ⓘ
“Clique is hard to approximate within n^{1−ε}” ⓘ “Inapproximability results for SAT and other problems” ⓘ Interactive Proofs and the Hardness of Approximating Cliques ⓘ
surface form:
“Some optimal inapproximability results”
|
| placeOfWork | Stockholm ⓘ |
| positionHeld | professor of theoretical computer science ⓘ |
| thesisTitle | Computational limitations of small-depth circuits ⓘ |
| workplace | KTH Royal Institute of Technology ⓘ |
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: Johan Håstad Description of subject: Johan Håstad is a Swedish theoretical computer scientist renowned for his groundbreaking work in computational complexity theory, particularly optimal inapproximability results and contributions to the PCP theorem.
Referenced by (5)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
Almost optimal lower bounds for small depth circuits
subject surface form:
Almost optimal lower bounds for small depth circuits
subject surface form:
Inapproximability results for SAT and other problems