获奖者：Princeton University  Sanjeev Arora   Charles C. Fitzmorris Professor of Computer Science

Press Release

Citation

For contributions to computational complexity, algorithms, and optimization that have helped reshape our understanding of computation.

Press Release

Full Citation

Sanjeev Arora is one of the architects of the Probabilistically Checkable Proofs (PCP) theorem, which revolutionized our understanding of complexity and the approximability of NP-hard problems. He helped create new approximation algorithms for fundamental optimization problems such as the Sparsest Cuts problem and the Euclidean Travelling Salesman problem, and contributed to the development of semi-definite programming as a practical algorithmic tool. He has played a pivotal role in some of the deepest and most influential results in theoretical computer science, and continues to inspire colleagues and new generations of researchers.

获奖教授主页

信息来自ACM网站

转载本文请联系原作者获取授权，同时请注明本文来自黄富强科学网博客。
链接地址：https://blog.sciencenet.cn/blog-89075-553301.html

上一篇：2011年图灵奖获得者Judea Pearl教授
下一篇：智能设计与智能生成120402