Subhash Khot | |
---|---|
Born | Ichalkaranji, Maharashtra, India | 10 June 1978
Alma mater | Princeton University, IIT Bombay |
Known for | Unique games conjecture |
Awards | Waterman Award (2010) Rolf Nevanlinna Prize (2014) MacArthur Fellow (2016) Fellow of the Royal Society (2017) |
Scientific career | |
Fields | Computer Science |
Institutions | Georgia Tech Courant Institute of Mathematical Sciences University of Chicago |
Doctoral advisor | Sanjeev Arora |
Subhash Khot FRS (born 10 June 1978 in Ichalkaranji) is an Indian-American mathematician and theoretical computer scientist who is the Julius Silver Professor of Computer Science in the Courant Institute of Mathematical Sciences at New York University. Khot has contributed to the field of computational complexity, and is best known for his unique games conjecture. [1]
Khot received the 2014 Rolf Nevanlinna Prize by the International Mathematical Union and received the MacArthur Fellowship in 2016. [2] He was elected a Fellow of the Royal Society in 2017 [3] and was inducted into the National Academy of Sciences in 2023. [4]
Khot obtained his bachelor's degree in computer science from the Indian Institute of Technology Bombay in 1999.[ citation needed ] He received his doctorate degree in computer science from Princeton University in 2003 under the supervision of Sanjeev Arora. His doctoral dissertation was titled "New Techniques for Probabilistically Checkable Proofs and Inapproximability Results." [5]
Khot is a two time silver medallist representing India at the International Mathematical Olympiad (1994 and 1995). [6] [7] Khot topped the highly difficult IIT JEE entrance exam in 1995.
He has been awarded the Microsoft Research New Faculty Fellowship Award (2005), [8] the Alan T. Waterman Award (2010), the Rolf Nevanlinna Prize for his work on the Unique Games Conjecture (2014), and the MacArthur Fellowship (2016). [9]
He was elected a Fellow of the Royal Society in 2017, [10] and was elected to the National Academy of Sciences in 2023. [11]
The IMU Abacus Medal, known before 2022 as the Rolf Nevanlinna Prize, is awarded once every four years at the International Congress of Mathematicians, hosted by the International Mathematical Union (IMU), for outstanding contributions in Mathematical Aspects of Information Sciences including:
Stephen Arthur Cook is an American-Canadian computer scientist and mathematician who has made significant contributions to the fields of complexity theory and proof complexity. He is a university professor emeritus at the University of Toronto, Department of Computer Science and Department of Mathematics.
Peter Williston Shor is an American professor of applied mathematics at MIT. He is known for his work on quantum computation, in particular for devising Shor's algorithm, a quantum algorithm for factoring exponentially faster than the best currently-known algorithm running on a classical computer.
Madhu Sudan is an Indian-American computer scientist. He has been a Gordon McKay Professor of Computer Science at the Harvard John A. Paulson School of Engineering and Applied Sciences since 2015.
Michael Hartley Freedman is an American mathematician at Microsoft Station Q, a research group at the University of California, Santa Barbara. In 1986, he was awarded a Fields Medal for his work on the 4-dimensional generalized Poincaré conjecture. Freedman and Robion Kirby showed that an exotic ℝ4 manifold exists.
Johan Torkel Håstad is a Swedish theoretical computer scientist most known for his work on computational complexity theory. He was the recipient of the Gödel Prize in 1994 and 2011 and the ACM Doctoral Dissertation Award in 1986, among other prizes. He has been a professor in theoretical computer science at KTH Royal Institute of Technology in Stockholm, Sweden since 1988, becoming a full professor in 1992. He is a member of the Royal Swedish Academy of Sciences since 2001.
Martin David Davis was an American mathematician and computer scientist who made significant contributions to the fields of computability theory and mathematical logic. He is best known for his work on Hilbert's tenth problem leading to the MRDP theorem. He also advanced the Post–Turing model and co-developed the Davis–Putnam–Logemann–Loveland (DPLL) algorithm, which is foundational for Boolean satisfiability solvers.
The Courant Institute of Mathematical Sciences is the mathematics research school of New York University (NYU), and is among the most prestigious mathematics schools and mathematical sciences research centers in the world. Founded in 1935, it is named after Richard Courant, one of the founders of the Courant Institute and also a mathematics professor at New York University from 1936 to 1972, and serves as a center for research and advanced training in computer science and mathematics. It is located on Gould Plaza next to the Stern School of Business and the economics department of the College of Arts and Science.
In computational complexity theory, the unique games conjecture is a conjecture made by Subhash Khot in 2002. The conjecture postulates that the problem of determining the approximate value of a certain type of game, known as a unique game, has NP-hard computational complexity. It has broad applications in the theory of hardness of approximation. If the unique games conjecture is true and P ≠ NP, then for many important problems it is not only impossible to get an exact solution in polynomial time, but also impossible to get a good polynomial-time approximation. The problems for which such an inapproximability result would hold include constraint satisfaction problems, which crop up in a wide variety of disciplines.
Aleksandr Aleksandrovich Razborov, sometimes known as Sasha Razborov, is a Soviet and Russian mathematician and computational theorist. He is Andrew McLeish Distinguished Service Professor at the University of Chicago.
Avi Wigderson is an Israeli mathematician and computer scientist. He is the Herbert H. Maass Professor in the school of mathematics at the Institute for Advanced Study in Princeton, New Jersey, United States of America. His research interests include complexity theory, parallel algorithms, graph theory, cryptography, distributed computing, and neural networks. Wigderson received the Abel Prize in 2021 for his work in theoretical computer science.
Charles Samuel Peskin is an American mathematician known for his work in the mathematical modeling of blood flow in the heart. Such calculations are useful in the design of artificial heart valves. From this work has emerged an original computational method for fluid-structure interaction that is now called the “immersed boundary method", which allows the coupling between deformable immersed structures and fluid flows to be handled in a computationally tractable way. With his students and colleagues, Peskin also has worked on mathematical models of such systems as the inner ear, arterial pulse, blood clotting, congenital heart disease, light adaptation in the retina, control of ovulation number, control of plasmid replication, molecular dynamics, and molecular motors.
Michael Ralph Fellows AC HFRSNZ MAE is a computer scientist and the Elite Professor of Computer Science in the Department of Informatics at the University of Bergen, Norway as of January 2016.
Daniel Alan Spielman has been a professor of applied mathematics and computer science at Yale University since 2006. As of 2018, he is the Sterling Professor of Computer Science at Yale. He is also the Co-Director of the Yale Institute for Network Science, since its founding, and chair of the newly established Department of Statistics and Data Science.
Constantinos Daskalakis is a Greek theoretical computer scientist. He is a professor at MIT's Electrical Engineering and Computer Science department and a member of the MIT Computer Science and Artificial Intelligence Laboratory. He was awarded the Rolf Nevanlinna Prize and the Grace Murray Hopper Award in 2018.
Leslie Frederick Greengard is an American mathematician, physicist and computer scientist. He is co-inventor with Vladimir Rokhlin Jr. of the fast multipole method (FMM) in 1987, recognized as one of the top-ten algorithms of the 20th century.
Elchanan Mossel is a professor of mathematics at the Massachusetts Institute of Technology. His primary research fields are probability theory, combinatorics, and statistical inference.
Bill Thies is an American computer scientist and senior principal researcher at Microsoft Research India and the recipient of the 2016 MacArthur Fellowship.