Thomas Jerome Schaefer
American mathematician
From Wikipedia, the free encyclopedia
Thomas Jerome Schaefer is an American mathematician.
EducationUniversity of California, Berkeley
KnownforSchaefer's dichotomy theorem
WorkplacesUniversity of California, Berkeley
Thomas Jerome Schaefer | |
|---|---|
| Education | University of California, Berkeley |
| Known for | Schaefer's dichotomy theorem |
| Scientific career | |
| Fields | Computational complexity theory, Game theory |
| Workplaces | University of California, Berkeley |
| Thesis | The Complexity of Some Two-Person Perfect-Information Games (1978) |
| Richard M. Karp | |
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.[1][2][3][4]
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.[5]
