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.
[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.
This article about an American mathematician is a stub.
You can help Wikipedia by expanding it.