Tripti Joshi (Editor)

Johan Håstad

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit
Nationality
  
Sweden

Fields
  
Computer Science

Role
  
Professor of mathematics

Name
  
Johan Hastad


Johan Hastad wwwcsckthsejohanhjohan0709smlJPG

Born
  
19 November 1960 (age 63) (
1960-11-19
)

Institutions
  
Royal Institute of Technology

Alma mater
  
Massachusetts Institute of Technology Uppsala University Stockholm University

Doctoral students
  
Gustav Hast Viggo Kann Jakob Nordstrom Marten Trolin Douglas Wikstrom

Notable awards
  
IMO gold medal (1977) ACM Doctoral Dissertation Award (1985) Godel Prize (1994, 2011)

Books
  
Computational limitations of small-depth circuits

Education
  
Uppsala University, Stockholm University, Massachusetts Institute of Technology

Similar People
  
Shafi Goldwasser, Mario Szegedy, Laszlo Babai, Madhu Sudan, Silvio Micali

Doctoral advisor
  
Shafi Goldwasser

Tucs distinguished lecture 4 4 2014 johan h stad


Johan Torkel Håstad ([ˈ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 is a professor in theoretical computer science at the Royal Institute of Technology in Stockholm, Sweden since 1992. He is a member of the Royal Swedish Academy of Sciences since 2001.

Contents

Johan Håstad Johan Hstad

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.

Håstad's thesis and Gödel Prize (1994) 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 Boolean function complexity.

He received the 2011 Gödel Prize for his work on optimal inapproximability results. In 2012, he became a fellow of the American Mathematical Society.

Inapproximability of constraint satisfaction problems iii


References

Johan Håstad Wikipedia