Johan Håstad
Theoretical computer scientist · KTH professor

Johan Håstad works in complexity theory and has won the Gödel Prize twice, in 1994 and 2011. Born in 1960, he won gold at the 1977 International Mathematical Olympiad. His doctorate came from MIT in 1986. Since 1988 he has been a professor at KTH.
His switching lemma became a key tool in circuit complexity. He later showed that a verifier can check NP proofs reading only three bits.
In 2001 he joined the Royal Swedish Academy of Sciences, and in 2018 he also took the Knuth Prize.
The Stockholm Culture Awards gave Johan Håstad its Cultural Mathematics award in 2019 for his contributions to theoretical computer science. His field is computational complexity theory. It investigates what is possible when computers are used to solve concrete problems, and the medal honoured his work in that field.
Know someone like Johan Håstad? Nominate an award winner