|
gptkbp:instanceOf
|
gptkb:person
|
|
gptkbp:almaMater
|
gptkb:KTH_Royal_Institute_of_Technology
|
|
gptkbp:awardReceived
|
gptkb:Gödel_Prize
gptkb:Gödel_Prize_2011
|
|
gptkbp:birthDate
|
1960
|
|
gptkbp:doctoralAdvisor
|
gptkb:Per_Enflo
|
|
gptkbp:employer
|
gptkb:KTH_Royal_Institute_of_Technology
|
|
gptkbp:field
|
gptkb:theoretical_computer_science
gptkb:complexity_theory
|
|
gptkbp:knownFor
|
gptkb:Håstad's_switching_lemma
optimal inapproximability results
|
|
gptkbp:member
|
gptkb:Royal_Swedish_Academy_of_Sciences
gptkb:Royal_Swedish_Academy_of_Engineering_Sciences
|
|
gptkbp:nationality
|
Swedish
|
|
gptkbp:occupation
|
gptkb:computer_scientist
gptkb:mathematician
|
|
gptkbp:thesisTitle
|
Computational limitations of small-depth circuits
|
|
gptkbp:thesisYear
|
1986
|
|
gptkbp:bfsParent
|
gptkb:Knuth_Prize
gptkb:Ronald_Linn_Rivest
gptkb:Godel_Prize
|
|
gptkbp:bfsLayer
|
5
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Johan Håstad
|