| 词条 | Thomas Jerome Schaefer |
| 释义 |
| honorific_prefix = | name = Thomas Jerome Schaefer | honorific_suffix = | native_name = | native_name_lang = | image = | image_size = | image_upright = | alt = | caption = | birth_date = | birth_place = | death_date = | death_place = | death_cause = | resting_place = | resting_place_coordinates = | other_names = | pronounce = | residence = | citizenship = | nationality = | fields = Computational complexity theory, Game theory | workplaces = University of California, Berkeley | patrons = | education = | alma_mater = University of California, Berkeley | thesis_title = The Complexity of Some Two-Person Perfect-Information Games | thesis_url = | thesis_year = 1978 | doctoral_advisor = Richard M. Karp | academic_advisors = | doctoral_students = | notable_students = | known_for = Schaefer's dichotomy theorem | influences = | influenced = | awards = | author_abbrev_bot = | author_abbrev_zoo = | spouse = | partner = | children = | signature = | signature_alt = | website = | footnotes = }} 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.[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] References1. ^{{mathGenealogy|31947}} {{Authority control}}{{DEFAULTSORT:Schaefer, Thomas Jerome}}{{US-mathematician-stub}}2. ^https://math.berkeley.edu/people/grad/thomas-jerome-schaefer 3. ^{{cite journal | url=http://www.sciencedirect.com/science/article/pii/0022000078900454/pdf?md5=13b84933ec4da81c929e67bb5219df19&pid=1-s2.0-0022000078900454-main.pdf&_valck=1 | author=Thomas J. Schaefer | title=On the Complexity of Some Two-Person Perfect-Information Games | journal=Journal of Computer and System Sciences | volume=16 | number=2 | pages=185–225 | month= | year=1978 | mr= 490917 |doi=10.1016/0022-0000(78)90045-4}} 4. ^{{cite book | url= | author=Thomas J. Schaefer | contribution=Complexity of Decision Problems Based on Finite Two-Person Perfect-Information Games | editor= | title=Eighth Annual ACM Symposium on Theory of Computing | publisher=ACM | series= | volume= | pages=41–49 | month= | year=1976 |mr= 0451853}} 5. ^{{cite book | contributionurl=http://www.ccs.neu.edu/home/lieber/courses/csg260/f06/materials/papers/max-sat/p216-schaefer.pdf | author=Schaefer, Thomas J. | contribution=The complexity of satisfiability problems | editor= | title=Proc. 10th Ann. ACM Symp. on Theory of Computing | series= | volume= | pages=216–226 | month= | year=1978 |mr= 521057}} 5 : Year of birth missing (living people)|Living people|American mathematicians|American computer scientists|University of California, Berkeley alumni |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。