Subhash Khot is a professor of computer science at the Courant Institute of Mathematical Sciences, New York University. Prior to joining NYU, he was on the faculty of Georgia Institute of Technology during 2004–2007. He has a Ph.D. from Princeton University in 2003. Khot received the Microsoft Research New Faculty Fellowship Award in 2005 and the Alan T. Waterman Award in 2010 for outstanding contribution towards computational complexity in unique games conjecture. In 2014, he was awarded the Rolf Nevanlinna Prize from the International Mathematical Union for his work on unique games conjecture.
Khot’s research is centered on computational complexity and its connections to geometry and analysis. In particular, he is interested in investigating whether one can efficiently compute approximate solutions to the so-called NP-hard problems for which efficiently computing exact solutions is widely believed to be infeasible.