Thomas Jerome Schaefer
http://dbpedia.org/resource/Thomas_Jerome_Schaefer an entity of type: Thing
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.
rdf:langString
rdf:langString
Thomas Jerome Schaefer
rdf:langString
Thomas Jerome Schaefer
rdf:langString
Thomas Jerome Schaefer
xsd:integer
55872451
xsd:integer
1047612917
rdf:langString
The Complexity of Some Two-Person Perfect-Information Games
xsd:integer
1978
rdf:langString
Computational complexity theory,Game theory
rdf:langString
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.
xsd:nonNegativeInteger
3818