Bill Gasarch
E735010
Bill Gasarch is a theoretical computer scientist and mathematician known for his work in computational complexity, combinatorics, and his widely read expository writing and blogging on complexity theory.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Bill Gasarch canonical | 1 |
Statements (30)
| Predicate | Object |
|---|---|
| instanceOf |
mathematician
ⓘ
person ⓘ theoretical computer scientist ⓘ |
| academicDiscipline |
computer science
ⓘ
mathematics ⓘ |
| countryOfCitizenship | United States of America ⓘ |
| employer | University of Maryland, College Park NERFINISHED ⓘ |
| fieldOfWork |
combinatorics
ⓘ
computational complexity theory ⓘ mathematics ⓘ theoretical computer science ⓘ |
| hasFamilyName | Gasarch NERFINISHED ⓘ |
| hasGivenName | Bill NERFINISHED ⓘ |
| knownFor |
blogging on complexity theory
ⓘ
expository writing on computational complexity ⓘ surveys in computational complexity ⓘ work on the P versus NP problem expository literature ⓘ |
| languageOfWorkOrName | English ⓘ |
| notableFor |
popular surveys on major open problems in complexity
ⓘ
widely read expository blog posts in complexity theory ⓘ |
| occupation | professor ⓘ |
| researchInterest |
combinatorics
ⓘ
computational complexity ⓘ theory of computation ⓘ |
| workLocation | College Park, Maryland NERFINISHED ⓘ |
| writesAbout |
P versus NP problem
NERFINISHED
ⓘ
combinatorics ⓘ complexity theory ⓘ theoretical computer science ⓘ |
| writesBlog | blog on computational complexity ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.