Jin-Yi Cai
 | This article, Jin-Yi Cai, has recently been created via the Articles for creation process. Please check to see if the reviewer has accidentally left this template after accepting the draft and take appropriate action as necessary.
Reviewer tools: Inform author |
 |
Jin-Yi Cai (Chinese: 蔡进一; born January 23, 1961) is Chinese American mathematician and computer scientist. He is a professor of computer science, and also the Steenbock Professor of Mathematical Sciences[1] at the University of Wisconsin-Madison. His research work focuses on algorithmic complexity theory and theoretical computer science. In recent years he has concentrated on the classification of computational counting problems, especially counting graph homomorphisms, counting constraint satisfaction problems, and Holant problems as related to holographic algorithms.
Early life
Cai was born in Shanghai, China. He attended Fudan University as a member of the class 77, graduating with a degree in ___________ TO DO PUT DEGREE HERE _____________ After coming to the United States in 1981, he attended Temple University studying with Donald J. Newman, and then at Cornell University, where he received his Ph. D. in 1986 under Juris Hartmanis.
Academic career
He became a faculty member at Yale University(1986-1989), Princeton University (1989-1993), and SUNY Buffalo (1993-2000), rising from Assistant Professor to Full Professor in 1996. He became a Professor of Computer Science at the University of Wisconsin-Madison in 2000.
Key contributions
Cai's research results include:
- His proof that with probability one a random oracle separates the polynomial-time hierarchy from PSPACE[2]
- The CFI-construction[3] (joint work with Martin Fürer and Neil Immerman).
- Complexity dichotomy theorems for the partition functions of graph homomorphisms, constraint satisfaction problems (CSP), and Holant problems[4][5][6]
His book Complexity Dichotomies for Counting Problems: Volume 1. Boolean Domain coauthored with Xi Chen) was published by the Cambridge University Press in 2018.[7]
Awards
Cai has been a Presidential Young Investigator, a Sloan Fellow, and a Guggenheim Fellow. He received a Morningside Silver Medal, a Humboldt Research Award for Senior U.S. Scientists. He was elected a Fellow of the Association for Computing Machinery (2001), American Association for the Advancement of Science (2007), and a foreign member of Academia Europaea (2017). He was jointly awarded the Gödel Prize in 2021, one of the most prestigious awards in theoretical computer science for his work in the paper titled: Complexity of Counting CSP with Complex Weights[8]
References
- ^ https://news.wisc.edu/two-faculty-members-named-steenbock-professors/
- ^ https://www.sciencedirect.com/science/article/pii/0022000089900330
- ^ https://link.springer.com/article/10.1007/BF01305232
- ^ https://epubs.siam.org/doi/abs/10.1137/110840194?mobileUi=0&
- ^ https://dl.acm.org/doi/abs/10.1145/2822891
- ^ https://epubs.siam.org/doi/abs/10.1137/17M1131672?af=R
- ^ https://www.cambridge.org/gb/academic/subjects/computer-science/algorithmics-complexity-computer-algebra-and-computational-g/complexity-dichotomies-counting-problems-volume-1?format=HB#DFBHvIwbXJQwt13s.97
- ^ https://sigact.org/prizes/gödel/citation2021.html