| dbo:abstract |
Thomas Jerome Schaefer is an American mathematician. He obtained his Ph.D. in December 1978 from the University of California, Berkeley, where he worked in the Department of Mathematics. His Ph.D. advisor was Richard M. Karp. He is well-known for his dichotomy theorem, stating that any problem generalizing Boolean satisfiability in a certain way is either in the complexity class P or is NP-complete. (en) |
| dbo:academicDiscipline |
dbr:Game_theory dbr:Computational_complexity_theory |
| dbo:almaMater |
dbr:University_of_California,_Berkeley |
| dbo:doctoralAdvisor |
dbr:Richard_M._Karp |
| dbo:institution |
dbr:University_of_California,_Berkeley |
| dbo:knownFor |
dbr:Schaefer's_dichotomy_theorem |
| dbo:wikiPageID |
55872451 (xsd:integer) |
| dbo:wikiPageLength |
3818 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID |
1047612917 (xsd:integer) |
| dbo:wikiPageWikiLink |
dbr:Richard_M._Karp dbr:University_of_California,_Berkeley dbc:Living_people dbc:Year_of_birth_missing_(living_people) dbr:Schaefer's_dichotomy_theorem dbr:Game_theory dbr:NP-complete dbr:Computational_complexity_theory dbc:20th-century_American_mathematicians dbc:21st-century_American_mathematicians dbc:American_computer_scientists dbc:University_of_California,_Berkeley_alumni dbr:Boolean_satisfiability_problem dbr:P_(complexity_class) |
| dbp:almaMater |
dbr:University_of_California,_Berkeley |
| dbp:doctoralAdvisor |
dbr:Richard_M._Karp |
| dbp:fields |
Computational complexity theory,Game theory (en) |
| dbp:knownFor |
dbr:Schaefer's_dichotomy_theorem |
| dbp:name |
Thomas Jerome Schaefer (en) |
| dbp:thesisTitle |
The Complexity of Some Two-Person Perfect-Information Games (en) |
| dbp:thesisYear |
1978 (xsd:integer) |
| dbp:wikiPageUsesTemplate |
dbt:Authority_control dbt:Reflist dbt:Short_description dbt:Infobox_scientist dbt:US-mathematician-stub |
| dbp:workplaces |
dbr:University_of_California,_Berkeley |
| dct:subject |
dbc:Living_people dbc:Year_of_birth_missing_(living_people) dbc:20th-century_American_mathematicians dbc:21st-century_American_mathematicians dbc:American_computer_scientists dbc:University_of_California,_Berkeley_alumni |
| rdf:type |
owl:Thing foaf:Person dbo:Person dul:NaturalPerson wikidata:Q19088 wikidata:Q215627 wikidata:Q5 wikidata:Q729 dbo:Animal dbo:Eukaryote dbo:Scientist dbo:Species schema:Person wikidata:Q901 |
| rdfs:comment |
Thomas Jerome Schaefer is an American mathematician. He obtained his Ph.D. in December 1978 from the University of California, Berkeley, where he worked in the Department of Mathematics. His Ph.D. advisor was Richard M. Karp. He is well-known for his dichotomy theorem, stating that any problem generalizing Boolean satisfiability in a certain way is either in the complexity class P or is NP-complete. (en) |
| rdfs:label |
Thomas Jerome Schaefer (en) |
| owl:sameAs |
wikidata:Thomas Jerome Schaefer https://global.dbpedia.org/id/42LZx |
| prov:wasDerivedFrom |
wikipedia-en:Thomas_Jerome_Schaefer?oldid=1047612917&ns=0 |
| foaf:isPrimaryTopicOf |
wikipedia-en:Thomas_Jerome_Schaefer |
| foaf:name |
Thomas Jerome Schaefer (en) |
| is dbo:doctoralStudent of |
dbr:Richard_M._Karp |
| is dbo:wikiPageWikiLink of |
dbr:List_of_game_theorists dbr:Richard_M._Karp dbr:List_of_American_mathematicians dbr:Boolean_satisfiability_problem |
| is dbp:doctoralStudents of |
dbr:Richard_M._Karp |
| is foaf:primaryTopic of |
wikipedia-en:Thomas_Jerome_Schaefer |