Johan Håstad

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Johan Håstad
Born (1960-11-19) 19 November 1960 (age 57)
Nationality Sweden
Alma mater
Awards
Scientific career
Fields Computer science
Institutions Royal Institute of Technology
Doctoral advisor Shafrira Goldwasser[1]

Johan Torkel Håstad (Swedish pronunciation: [ˈjuːˈan ˈhoːˈstad]; born 19 November 1960) is a Swedish theoretical computer scientist most known for his work on computational complexity theory. He was the recipient of the Gödel Prize in 1994 and 2011 and the ACM Doctoral Dissertation Award in 1986, among other prizes. He has been a professor in theoretical computer science at the Royal Institute of Technology in Stockholm, Sweden since 1988, becoming a full professor in 1992. He is a member of the Royal Swedish Academy of Sciences since 2001.

He received his B.S. in Mathematics at Stockholm University in 1981, his M.S. in Mathematics at Uppsala University in 1984 and his Ph.D. in Mathematics from MIT in 1986.[2]

Håstad's thesis and 1994 Gödel Prize concerned his work on lower bounds on the size of constant-depth Boolean circuits for the parity function. After Andrew Yao proved that such circuits require exponential size, Håstad proved nearly optimal lower bounds on the necessary size through his switching lemma, which became an important technical tool in circuit complexity with applications to learnability, the IP hierarchy, and proof systems.[3]

He also received the 2011 Gödel Prize for his work on optimal inapproximability results. In particular, he improved the PCP theorem (which won the same prize in 2001) to give a probabilistic verifier for NP problems which reads only three bits. Further, he used these results to prove results in hardness of approximation.[4]

In 1999 Håstad was an Erdős Lecturer at the Hebrew University of Jerusalem. In 2012, he became a fellow of the American Mathematical Society.[5]

References[edit]

External links[edit]