|
instanceOf
|
computer scientist
→
human
→
mathematician
→
theoretical computer scientist
→
|
|
academicDegree
|
PhD in computer science
→
|
|
affiliation
|
School of Computer Science and Communication at KTH
→
|
|
awardReceived
|
ACM Paris Kanellakis Theory and Practice Award
→
ACM SIGACT Gödel Prize
→
Gödel Prize
→
Gödel Prize 1994
→
Gödel Prize 2011
→
Royal Swedish Academy of Engineering Sciences Gold Medal
→
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”
→
“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
→
|