About: Johan Håstad     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:UppsalaUniversityAlumni, within Data Space : dbpedia-live.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia-live.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FJohan_HÃ¥stad

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 is a professor in theoretical computer science at the Royal Institute of Technology in Stockholm, Sweden since 1992.

AttributesValues
rdf:type
sameAs
foaf:isPrimaryTopicOf
foaf:name
  • Johan Håstad
rdfs:comment
  • 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 is a professor in theoretical computer science at the Royal Institute of Technology in Stockholm, Sweden since 1992.
rdfs:label
  • Johan Håstad
has abstract
  • 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 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.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.
academic discipline
alma mater
award
birth date
doctoral advisor
institution
nationality
Link to the Wikipage edit URL
Link from a Wikipage to an external page
extraction datetime
Link to the Wikipage history URL
Wikipage page ID
page length (characters) of wiki page
Wikipage modification datetime
Wiki page out degree
Wikipage revision ID
Link to the Wikipage revision URL
dbp:almaMater
dbp:awards
dbp:birthDate
dbp:doctoralAdvisor
dbp:fields
dbp:name
  • Johan Håstad
dbp:nationality
dbp:wikiPageUsesTemplate
dbp:workplaces
Faceted Search & Find service v1.17_git39 as of Aug 10 2019


Alternative Linked Data Documents: iSPARQL | ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3319 as of Sep 1 2020, on Linux (x86_64-generic-linux-glibc25), Single-Server Edition (61 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2020 OpenLink Software